bridgeless graph has a cycle-continuous mapping to the Petersen graph. More unsolved problems in mathematics In the mathematical field of graph theory, the...

They include the Petersen graph and generalize one of the ways of constructing the Petersen graph. The generalized Petersen graph family was introduced...

from the Petersen graph. The 50-vertex Watkins snark was discovered in 1989. Another notable cubic non-three-edge-colorable graph is Tietze's graph, with...

contributions to the field of mathematics led to the birth of graph theory. Petersen's interests in mathematics were manifold, including: geometry, complex...

matrix of a graph (this part of algebraic graph theory is also called spectral graph theory). For the Petersen graph, for example, the spectrum of the adjacency...

and these graphs are not 1-factorable; examples of such graphs include: Any regular graph with an odd number of nodes. The Petersen graph. A 1-factorization...

The complete graph K6, the Petersen graph, and the other five graphs in the Petersen family do not have linkless embeddings. Every graph minor of a linklessly...

In graph theory, the Petersen family is a set of seven undirected graphs that includes the Petersen graph and the complete graph K6. The Petersen family...

individual graphs are cubic and symmetric, including the utility graph, the Petersen graph, the Heawood graph, the Möbius–Kantor graph, the Pappus graph, the...

 9, −5]4. The Nauru graph can also be constructed as the generalized Petersen graph G(12, 5) which is formed by the vertices of a dodecagon connected to...

databases. The name "Desargues graph" has also been used to refer to a ten-vertex graph, the complement of the Petersen graph, which can also be formed as...

generalized Petersen graph G(9,2) is non-planar, triangle-free, and uniquely 3-edge-colorable. For many years it was the only known such graph, and it had...

O3 = K(5, 2) is the Petersen graph (see top right figure). The Kneser graph O4 = K(7, 3), visualized on the right. The Kneser graph K ( n , k ) {\displaystyle...

mathematical discipline of graph theory, Petersen's theorem, named after Julius Petersen, is one of the earliest results in graph theory and can be stated...

of graph theory this is an embedding of the Petersen graph on a real projective plane. With this embedding, the dual graph is K6 (the complete graph with...

The Petersen Graph is a mathematics book about the Petersen graph and its applications in graph theory. It was written by Derek Holton and John Sheehan...

distance graphs include the cactus graphs, the matchstick graphs and penny graphs, and the hypercube graphs. The generalized Petersen graphs are non-strict...

10-cage, the Harries graph and the Harries–Wong graph. The Petersen graph has a girth of 5 The Heawood graph has a girth of 6 The McGee graph has a girth of...

vertices of a cube graph, or as the generalized Petersen graph G(6,2). As with any graph of a convex polyhedron, the Dürer graph is a 3-vertex-connected...

Ferdinand Möbius and Seligmann Kantor. It can be defined as the generalized Petersen graph G(8,3): that is, it is formed by the vertices of an octagon, connected...

Does a Moore graph with girth 5 and degree 57 exist? More unsolved problems in mathematics In graph theory, a Moore graph is a regular graph whose girth...

graphs (such as the Petersen graph, the Heawood graph and the vertices and edges of the Platonic solids). The finite Cayley graphs (such as cube-connected...

There are 525 copies of the Petersen graph, with each 6-cycle belonging to exactly one Petersen each. Removing any one Petersen leaves a copy of the unique...

hypohamiltonian graphs with at most 17 vertices is known: they are the 10-vertex Petersen graph, a 13-vertex graph and a 15-vertex graph found by computer...

Coxeter graph. Only five examples of vertex-transitive graph with no Hamiltonian cycles are known : the complete graph K2, the Petersen graph, the Coxeter...

Heawood graph, the complete graph K7 (and hence K5 and K6), the Petersen graph (and hence the complete bipartite graph K3,3, since the Petersen graph contains...

Graphs associated with the Desargues configuration include the Desargues graph (its graph of point-line incidences) and the Petersen graph (its graph...

out" to referee the game). The case that n = 3 gives the well-known Petersen graph. As Biggs (1972) explains the problem (for n = 6), the players wish...

each point. The Desargues graph can also be viewed as the generalized Petersen graph G(10,3) or the bipartite Kneser graph with parameters 5,2. It is...

graph Cameron graph Petersen graph Hall–Janko graph Hoffman–Singleton graph Higman–Sims graph Paley graph of order 13 Shrikhande graph Schläfli graph...