of graph theory, a cubic graph is a graph in which all vertices have degree three. In other words, a cubic graph is a 3-regular graph. Cubic graphs are...

problems in graph theory. The Petersen graph is named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no...

{b}{3a}}.} The graph of a cubic function is a cubic curve, though many cubic curves are not graphs of functions. Although cubic functions depend on...

field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood. The graph is cubic, and all...

In the mathematical field of graph theory, the Desargues graph is a distance-transitive, cubic graph with 20 vertices and 30 edges. It is named after...

there are infinitely many asymmetric cubic graphs. The class of asymmetric graphs is closed under complements: a graph G is asymmetric if and only if its...

the unique smallest cubic graph of girth 8, it is a cage and a Moore graph. It is bipartite, and can be constructed as the Levi graph of the generalized...

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...

confused with cubic graphs, which are graphs that have exactly three edges touching each vertex. The only hypercube graph Qn that is a cubic graph is the cubical...

The Petersen graph is the unique 5-cage (it is the smallest cubic graph of girth 5), the Heawood graph is the unique 6-cage, the McGee graph is the unique...

needed for the edges of a cubic graph is either three ("class one" graphs) or four ("class two" graphs), so snarks are cubic graphs of class two. However...

The connected 3-regular (cubic) simple graphs are listed for small vertex numbers. The number of connected simple cubic graphs on 4, 6, 8, 10, ... vertices...

graph theory, the crossing number cr(G) of a graph G is the lowest number of edge crossings of a plane drawing of the graph G. For instance, a graph is...

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...

Other well known cubic symmetric graphs are the Dyck graph, the Foster graph and the Biggs–Smith graph. The ten distance-transitive graphs listed above,...

uniquely 3-edge-colorable graphs that do not fit into this classification, such as the graph of the triangular pyramid. If a cubic graph is uniquely 3-edge-colorable...

coordinatization of the diamond cubic involves the removal of some of the edges from a three-dimensional grid graph. In this coordinatization, which...

in 2002 and named after Ljubljana (the capital of Slovenia). It is a cubic graph with diameter 8, radius 7, chromatic number 2 and chromatic index 3....

3-edge-connected. The Wagner graph has 392 spanning trees; it and the complete bipartite graph K3,3 have the most spanning trees among all cubic graphs with the same...

automorphism group of a connected graph – indeed, of a cubic graph. Constructing the automorphism group of a graph, in the form of a list of generators...

In the mathematical field of graph theory, the Frucht graph is a cubic graph with 12 vertices, 18 edges, and no nontrivial symmetries. It was first described...

field of graph theory, the Coxeter graph is a 3-regular graph with 28 vertices and 42 edges. It is one of the 13 known cubic distance-regular graphs. It is...

mathematics, Tait's conjecture states that "Every 3-connected planar cubic graph has a Hamiltonian cycle (along the edges) through all its vertices"....

follows: Petersen's Theorem. Every cubic, bridgeless graph contains a perfect matching. In other words, if a graph has exactly three edges at each vertex...

mathematical field of graph theory, the Gray graph is an undirected bipartite graph with 54 vertices and 81 edges. It is a cubic graph: every vertex touches...

In the mathematical field of graph theory, the Nauru graph is a symmetric, bipartite, cubic graph with 24 vertices and 36 edges. It was named by David...

In the mathematical field of graph theory, Tietze's graph is an undirected cubic graph with 12 vertices and 18 edges. It is named after Heinrich Franz...

Bivariegated graph Cage (graph theory) Cayley graph Circle graph Clique graph Cograph Common graph Complement of a graph Complete graph Cubic graph Cycle graph De...

vertices in the cycle. It is a cubic, circulant graph, so-named because (with the exception of M6 (the utility graph K3,3), Mn has exactly n/2 four-cycles...

= 0) Cubic form, a homogeneous polynomial of degree 3 Cubic graph (mathematics - graph theory), a graph where all vertices have degree 3 Cubic plane...