Every generalized Petersen graph has a Tait coloring

DOI10.2140/pjm.1972.40.53zbMath0236.05106OpenAlexW2036818292WikidataQ55920245 ScholiaQ55920245MaRDI QIDQ2552137

Frank Castagna, Geert C. E. Prins

Publication date: 1972

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1972.40.53

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (32)

Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\) ⋮ A 1-factorization of the line graphs of complete graphs ⋮ Quadratic leaves of maximal partial triple systems ⋮ Hamilton cycles in double generalized Petersen graphs ⋮ The cost of perfection for matchings in graphs ⋮ Updating the hamiltonian problem—A survey ⋮ Jacobsthal numbers in generalised Petersen graphs ⋮ The existence of resolvable Steiner quadruple systems ⋮ Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms ⋮ Local coloring of self complementary graphs ⋮ Which generalized petersen graphs are cayley graphs? ⋮ Recognizing generalized Petersen graphs in linear time ⋮ Jacobsthal Numbers in Generalized Petersen Graphs ⋮ A result on Hamiltonian cycles in generalized Petersen graphs ⋮ Is the five-flow conjecture almost false? ⋮ Classifying 2-extendable generalized Petersen graphs ⋮ Partitioning oriented 2-paths ⋮ On the minimum vertex cover of generalized Petersen graphs ⋮ Geometric coloring theory ⋮ Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs ⋮ Hamiltonian cycles in generalized Petersen graphs ⋮ The isomorphism classes of the generalized Petersen graphs ⋮ On automorphisms and structural properties of double generalized Petersen graphs ⋮ A bibliographic survey of edge‐colorings ⋮ Nonorientable genus of cartesian products of regular graphs ⋮ On the Hamilton connectivity of generalized Petersen graphs ⋮ Generalized Petersen graphs which are cycle permutation graphs ⋮ The classification of Hamiltonian generalized Petersen graphs ⋮ Completing small partial triple systems ⋮ $K_2$-Hamiltonian Graphs: I ⋮ On cycle permutation graphs ⋮ On perfectly one–factorable cubic graphs

This page was built for publication: Every generalized Petersen graph has a Tait coloring