On colorability of graphs with forbidden minors along paths and circuits

DOI10.1016/J.DISC.2011.01.014zbMath1222.05063OpenAlexW1997862973MaRDI QIDQ533778

Elad Aigner-Horev

Publication date: 6 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.01.014

zbMATH Keywords

chromatic numberbridges of circuits

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A refinement of Kuratowski's theorem
• Non-separating induced cycles in graphs
• Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
• Some recent problems and results in graph theory
• Fruit salad
• Proof of a conjecture of Bollobás on nested cycles
• Topological cliques in graphs II

This page was built for publication: On colorability of graphs with forbidden minors along paths and circuits