On the number of 3-edge colorings of cubic graphs

DOI10.1006/eujc.1999.0440zbMath0993.05069OpenAlexW1978463456MaRDI QIDQ1348773

Christian Szegedy

Publication date: 23 September 2002

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7740d98d7fb0231972772d0cf3c4e32b94e3b439

zbMATH Keywords

matroidsbinary matroidPenrose polynomial3-edge coloringplane cubic graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)

Related Items

Colorings with few colors: counting, enumeration and combinatorial bounds, Arithmetic progressions, different regularity lemmas and removal lemmas

Cites Work

• On Tutte polynomials and cycles of plane graphs
• On Tutte polynomials of matroids representable over \(GF(q)\)
• On the Penrose number of cubic diagrams
• The Penrose polynomial of a plane graph
• On the Principal Edge Tripartition of a Graph
• A new 5‐arc‐transitive cubic graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item