graph, a block graph, a split graph, an interval graph, a claw-free graph, a 1-vertex-connected graph and a 1-edge-connected graph. A graph is bull-free...

Brinkmann graph Bull graph Butterfly graph Chvátal graph Diamond graph Dürer graph Ellingham–Horton 54-graph Ellingham–Horton 78-graph Errera graph Franklin...

In the mathematical field of graph theory, a graph G is symmetric or arc-transitive if, given any two ordered pairs of adjacent vertices ( u 1 , v 1 )...

In geometric graph theory, a branch of mathematics, a polyhedral graph is the undirected graph formed from the vertices and edges of a convex polyhedron...

perfect graph theorem, for the graphs that have no bull graph as an induced subgraph.[B] Their work in this area introduced a type of graph decomposition...

various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...

and "Probabilistic Checking of Proofs: A New Characterization of NP". Bull graph Set cover problem Vertex cover problem Muli Safra's Homepage Computational...

is a graph polynomial. It is a polynomial in two variables which plays an important role in graph theory. It is defined for every undirected graph G {\displaystyle...

In the mathematical field of graph theory, the Goldner–Harary graph is a simple undirected graph with 11 vertices and 27 edges. It is named after Anita...

In graph theory, the strong perfect graph theorem is a forbidden graph characterization of the perfect graphs as being exactly the graphs that have neither...

In graph theory, a branch of mathematics, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges. It is a polyhedral graph (the...

graph is called a coin graph; more generally, intersection graphs of interior-disjoint geometric objects are called tangency graphs or contact graphs...

In mathematics, and, in particular, in graph theory, a rooted graph is a graph in which one vertex has been distinguished as the root. Both directed and...

In mathematical graph theory, the rooted product of a graph G and a rooted graph H is defined as follows: take |V(G)| copies of H, and for every vertex...

especially in the fields of universal algebra and graph theory, a graph algebra is a way of giving a directed graph an algebraic structure. It was introduced...

mathematics Are graphs uniquely determined by their subgraphs? More unsolved problems in mathematics Informally, the reconstruction conjecture in graph theory...

In the mathematical field of graph theory, the Robertson graph or (4,5)-cage, is a 4-regular undirected graph with 19 vertices and 38 edges named after...

form of a directed acyclic graph with a single source vertex (a vertex with no incoming edges), in which each edge of the graph is labeled by a letter or...

In graph theory, a tournament is a directed graph with exactly one edge between each two vertices, in one of the two possible directions. Equivalently...

combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory...

its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently large complete graph. To...

(1975). "Review of Algebraic graph theory by Norman Biggs and Combinatorial theory seminar by Jacobus H. van Lint" (PDF). Bull. Amer. Math. Soc. 81 (3):...

In graph theory, a branch of mathematics, the circuit rank, cyclomatic number, cycle rank, or nullity of an undirected graph is the minimum number of...

decompositions of cubic graphs". Bull. Austral. Math. Soc. 8 (3): 367–387. doi:10.1017/S0004972700042660. Weisstein, Eric W. "Hypohamiltonian Graph". MathWorld....

terms of graph theory, by considering it in terms of constructing a graph coloring of the planar graph of adjacencies between regions. In graph-theoretic...

Red Bull Stratos was a high-altitude skydiving project involving Austrian skydiver Felix Baumgartner. On 14 October 2012, Baumgartner flew approximately...

Michael O. (1999). "Review: Modern graph theory, by Béla Bollobás, and Graph theory, by Reinhard Diestel" (PDF). Bull. Amer. Math. Soc. (N.S.). 36 (3):...

as the number of sets in the group. The graph theoretic formulation answers whether a finite bipartite graph has a perfect matching—that is, a way to...

genus Bos. Mature female cattle are called cows and mature male cattle are bulls. Young female cattle are called heifers, young male cattle are oxen or bullocks...

In graph theory, a branch of mathematics, the Moser spindle (also called the Mosers' spindle or Moser graph) is an undirected graph, named after mathematicians...