The thickness and chromatic number of r-inflated graphs

DOI10.1016/J.DISC.2010.04.019MaRDI QIDQ709322zbMATH OpenOpenAlexFDO

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

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

chromatic numbergraph coloringarboricitythicknessindependence number\(r\)-inflation

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• More results on \(r\)-inflated graphs: arboricity, thickness, chromatic number and fractional chromatic number
• Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs
• scientific article; zbMATH DE number 3841895
• Thickness and colorability of geometric graphs
• Remarks on the thickness of a graph

Cites work

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

Cited in

(3)

• More results on \(r\)-inflated graphs: arboricity, thickness, chromatic number and fractional chromatic number
• On the biplanarity of blowups
• Hadwiger's conjecture for inflations of 3-chromatic graphs

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

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