Sketchy tweets: ten minute conjectures in graph theory

DOI10.1007/s00283-012-9275-2zbMath1239.05186OpenAlexW1964700291WikidataQ123365249 ScholiaQ123365249MaRDI QIDQ2429454

Richard J. Nowakowski, Anthony Bonato

Publication date: 27 April 2012

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00283-012-9275-2

zbMATH Keywords

tutorial

Mathematics Subject Classification ID

Graph theory (05C99) Graph theory (educational aspects) (97K30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• Cops and robbers in graphs with large girth and Cayley graphs
• Flows and generalized coloring theorems in graphs
• Nowhere-zero 6-flows
• Ramsey's theorem - a new lower bound
• Every planar map is four colorable. II: Reducibility
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• A dynamic survey of graph labeling
• A survey on Hedetniemi's conjecture
• Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
• The early history of the brick factory problem
• E ₁₁ and M theory
• Vizing's conjecture: a survey and recent results
• Tutte's 5-flow conjecture for the projective plane
• An upper bound for some ramsey numbers
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
• The crossing number of K5,n
• Polyhedral decompositions of cubic graphs
• Some remarks on the theory of graphs
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• A Contribution to the Theory of Chromatic Polynomials
• On a problem of P. Turan concerning graphs
• Hedetniemi's conjecture---a survey

This page was built for publication: Sketchy tweets: ten minute conjectures in graph theory