On the Penrose number of cubic diagrams

DOI10.1016/0012-365X(89)90201-XzbMath0679.05029MaRDI QIDQ1124600

François Jaeger

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cubic graphplanecubic diagramnumber of edge 3-coloringsPenrose number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

On the number of 3-edge colorings of cubic graphs, On two generalizations of the Alon-Tarsi polynomial method, A solution to a colouring problem of P. Erdős, Hopf algebras and the Penrose polynomial, Planar diagrams for local invariants of graphs in surfaces, List edge colourings of some 1-factorable multigraphs, Transition polynomials

Cites Work

• Every planar map is four colorable. II: Reducibility
• Le Polynôme De Martin D'un Graphe Eulerien
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item