One More Probabilistic Reformulation of the Four Colour Conjecture

DOI10.1017/S0963548310000246zbMath1261.05095OpenAlexW2130070724WikidataQ56896608 ScholiaQ56896608MaRDI QIDQ4911115

Yu. V. Matiyasevich

Publication date: 13 March 2013

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548310000246

zbMATH Keywords

planar graphfour colour theoremprobabilistic reformulationequivalent to four colour problem

Mathematics Subject Classification ID

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

Cites Work

• Coboundaries, flows, and Tutte polynomials of matrices
• Map coloring and the vector cross product
• The four-colour theorem
• The number of edge 3-colorings of a planar cubic graph as a permanent
• Parity, Eulerian subgraphs and the Tutte polynomial
• Some new evaluations of the Tutte polynomial
• Every Planar Map is Four Colorable
• Some probabilistic restatements of the Four Color Conjecture

This page was built for publication: One More Probabilistic Reformulation of the Four Colour Conjecture