In graph theory, an area of mathematics, a claw-free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the...

area of graph theory, a triangle-free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle-free graphs may be equivalently...

Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...

distortion. Scale-free networks do not arise by chance alone. Erdős and Rényi (1960) studied a model of growth for graphs in which, at each step, two nodes...

In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation...

knowledge graph in Wiktionary, the free dictionary. A knowledge graph is a knowledge base that uses a graph-structured data model. Knowledge Graph may also...

In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. That is, it is a...

In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges, vertices and by contracting edges...

In graph theory, a graph property or graph invariant is a property of graphs that depends only on the abstract structure, not on graph representations...

Look up Graph, graph, or -graph in Wiktionary, the free dictionary. Wikimedia Commons has media related to Graphs. Graph may refer to: Graph (discrete...

undirected graph. A forest is an undirected graph in which any two vertices are connected by at most one path, or equivalently an acyclic undirected graph, or...

In graph theory, a branch of mathematics, a t-biclique-free graph is a graph that has no Kt,t (complete bipartite graph with 2t vertices) as a subgraph...

In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges...

In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is...

characterization of interval graphs as AT-free chordal graphs, interval graphs are strongly chordal graphs and hence perfect graphs. Their complements belong...

In the mathematical field of graph theory, the Grötzsch graph is a triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number...

In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first...

In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every...

In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain...

simple graphs with five vertices. One of them is the butterfly graph. The two others are cycle graph C5 and the complete graph K5. A graph is bowtie-free if...

In graph theory, the girth of an undirected graph is the length of a shortest cycle contained in the graph. If the graph does not contain any cycles (that...

In the mathematical field of graph theory, the complement or inverse of a graph G is a graph H on the same vertices such that two distinct vertices of...

In graph theory, a clique (/ˈkliːk/ or /ˈklɪk/) is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are...

In the mathematical area of graph theory, the Mycielskian or Mycielski graph of an undirected graph is a larger graph formed from it by a construction...

a universal graph is an infinite graph that contains every finite (or at-most-countable) graph as an induced subgraph. A universal graph of this type...

mathematics Must every cubic graph contain a simple cycle of length a power of two? More unsolved problems in mathematics In graph theory, the unproven Erdős–Gyárfás...

has the largest number of edges among all Kr+1-free n-vertex graphs. Turán's theorem, and the Turán graphs giving its extreme case, were first described...

A graph database (GDB) is a database that uses graph structures for semantic queries with nodes, edges, and properties to represent and store data. A key...

In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not...

graph (graphs in which every neighborhood is a cluster graph) are the diamond-free graphs, another family of graphs that contains the cluster graphs....