Some probabilistic restatements of the Four Color Conjecture

DOI10.1002/JGT.10178MaRDI QIDQ4474281zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Yu. Matiyasevich

Publication date 4 August 2004

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10178

zbMATH Keywords

probabilisticgraph polynomialfour color theoremTait coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• One Probabilistic Equivalent of the Four Color Conjecture
• One More Probabilistic Reformulation of the Four Colour Conjecture
• Some arithmetical restatements of the four color conjecture
• scientific article; zbMATH DE number 849955
• Four color theorem from three points of view

Cites work

• scientific article; zbMATH DE number 475583 (Why is no real title available?)
• scientific article; zbMATH DE number 733419 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• Every Planar Map is Four Colorable

Cited in

(9)

• Some arithmetical restatements of the four color conjecture
• One Probabilistic Equivalent of the Four Color Conjecture
• One More Probabilistic Reformulation of the Four Colour Conjecture
• Proof of a conjecture of Bowlin and Brin on four-colouring triangulations
• Congruence conditions, parcels, and Tutte polynomials of graphs and matroids
• Parity, Eulerian subgraphs and the Tutte polynomial
• Some new evaluations of the Tutte polynomial
• Coloring planar graphs via colored paths in the associahedra
• An approximate restatement of the Four-Color Theorem

This page was built for publication: Some probabilistic restatements of the Four Color Conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474281)