Ars Mathematica Contemporanea · 2013 · 17 citations · 9 references
Natural SciencesMathematicsColor TheoryCombinatoricsTopologyColor ModelsGraph ColoringChromatic PolynomialsColoring TheoremsStrong ColoringSubdivision
In this paper we study Petersen-colorings and strong Petersen-colorings on some well known families of snarks, e.g. Blanuša snarks, Goldberg snarks and flower snarks. In particular, it is shown that flower snarks have a Petersen-coloring but they do not have a strong Petersen-coloring. Furthermore it is proved that possible minimum counterexamples to Jaeger’s Petersen-coloring conjecture do not contain a specific subdivision of K 3, 3 .
9
Blocking and anti-blocking pairs of polyhedra
D. R. Fulkerson · Mathematical Programming · 1971 · 540 citations
Generation and properties of snarks
Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund et al. · 2016 · 105 citations