The thickness and chromatic number of r-inflated graphs

DOI10.1016/J.DISC.2010.04.019zbMATH Open1221.05123OpenAlexW2166226944MaRDI QIDQ709322FDOQ709322

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

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

zbMATH Keywords

chromatic numbergraph coloringarboricitythicknessindependence number\(r\)-inflation

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Every planar map is four colorable. II: Reducibility
• On a special case of Hadwiger's conjecture
• Title not available (Why is that?)
• Decomposition of Finite Graphs Into Forests
• Every planar map is four colorable
• Title not available (Why is that?)
• Some remarks on Hajós' conjecture
• Title not available (Why is that?)
• The wonderful Walecki construction
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Hajos' graph-coloring conjecture: Variations and counterexamples
• Title not available (Why is that?)
• Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon
• Title not available (Why is that?)
• A proof of the four color theorem
• The Non-Biplanar Character of the Complete 9-Graph
• Star-extremal graphs and the lexicographic product
• Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
• Some results on the Oberwolfach problem. (Decomposition of complete graphs into isomorphic quadratic factors.)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)