Note on a conjecture of Toft

DOI10.1007/BF01299743zbMath0832.05038WikidataQ123245427 ScholiaQ123245427MaRDI QIDQ1900186

Tommy R. Jensen, F. Bruce Shepherd

Publication date: 8 February 1996

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

subdivisionpolynomial algorithmline graphsconjecture of Toftfully odd subdivision

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On the multiple Borsuk numbers of sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note to a problem of T. Gallai and G. A. Dirac
• Matrices with the Edmonds-Johnson property
• Gallai's problem on Dirac's construction
• Some simplified NP-complete graph problems
• Hajos' graph-coloring conjecture: Variations and counterexamples
• On certain polytopes associated with graphs
• 4-critical 4-valent planar graphs constructed with crowns.
• Small graphs with chromatic number 5: A computer search
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: Note on a conjecture of Toft