Search results
Results from the WOW.Com Content Network
According to Brooks' theorem every connected cubic graph other than the complete graph K 4 has a vertex coloring with at most three colors. Therefore, every connected cubic graph other than K 4 has an independent set of at least n/3 vertices, where n is the number of vertices in the graph: for instance, the largest color class in a 3-coloring has at least this many vertices.
The number of connected simple cubic graphs on 4, 6, 8, 10, ... vertices is 1, 2, 5, 19, ... (sequence A002851 in the OEIS). A classification according to edge connectivity is made as follows: the 1-connected and 2-connected graphs are defined as usual. This leaves the other graphs in the 3-connected class because each 3-regular graph can be ...
every cubic bridgeless graph without Petersen minor has a cycle double cover. [13] is the smallest cubic graph with Colin de Verdière graph invariant μ = 5. [14] is the smallest graph of cop number 3. [15] has radius 2 and diameter 2. It is the largest cubic graph with diameter 2. [b] has 2000 spanning trees, the most of any 10-vertex cubic ...
In a cubic graph with a perfect matching, the edges that are not in the perfect matching form a 2-factor. By orienting the 2-factor, the edges of the perfect matching can be extended to paths of length three, say by taking the outward-oriented edges. This shows that every cubic, bridgeless graph decomposes into edge-disjoint paths of length ...
In graph theory, the Möbius ladder M n, for even numbers n, is formed from an n-cycle by adding edges (called "rungs") connecting opposite pairs of vertices in the cycle. It is a cubic, circulant graph, so-named because (with the exception of M 6 (the utility graph K 3,3), M n has exactly n/2 four-cycles [1] which link together by their shared edges to form a topological Möbius strip.
The smallest cubic graphs with crossing numbers 1–11 are known (sequence A110507 in the OEIS). The smallest 1-crossing cubic graph is the complete bipartite graph K 3,3, with 6 vertices. The smallest 2-crossing cubic graph is the Petersen graph, with 10 vertices. The smallest 3-crossing cubic graph is the Heawood graph, with 14 vertices
In the mathematical field of graph theory, the Harries graph or Harries (3-10)-cage is a 3-regular, undirected graph with 70 vertices and 105 edges. [1] The Harries graph has chromatic number 2, chromatic index 3, radius 6, diameter 6, girth 10 and is Hamiltonian. It is also a 3-vertex-connected and 3-edge-connected, non-planar, cubic graph.
In the mathematical field of graph theory, the Harries–Wong graph is a 3-regular undirected graph with 70 vertices and 105 edges. [1] The Harries–Wong graph has chromatic number 2, chromatic index 3, radius 6, diameter 6, girth 10 and is Hamiltonian. It is also a 3-vertex-connected and 3-edge-connected non-planar cubic graph.