The thickness and chromatic number of \(r\)-inflated graphs

DOI10.1016/j.disc.2010.04.019zbMath1221.05123OpenAlexW2166226944MaRDI QIDQ709322

Debra L. Boutin, Ellen Gethner, Michael O. Albertson

Publication date: 18 October 2010

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

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

zbMATH Keywords

thicknessgraph coloringindependence numberchromatic numberarboricity\(r\)-inflation

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Hadwiger's conjecture for inflations of 3-chromatic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks on Hajós' conjecture
• Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Some results on the Oberwolfach problem. (Decomposition of complete graphs into isomorphic quadratic factors.)
• A proof of the four color theorem
• Hajos' graph-coloring conjecture: Variations and counterexamples
• Every planar map is four colorable. II: Reducibility
• Star-extremal graphs and the lexicographic product
• Every planar map is four colorable
• Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon
• On a special case of Hadwiger's conjecture
• Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs
• The Non-Biplanar Character of the Complete 9-Graph
• Decomposition of Finite Graphs Into Forests

This page was built for publication: The thickness and chromatic number of \(r\)-inflated graphs