The thickness and chromatic number of \(r\)-inflated graphs
type: Item
instance of: scholarly article
title: The thickness and chromatic number of \(r\)-inflated graphs
zbMATH Open document ID: 1221.05123
author: Michael O. Albertson
author: Debra L. Boutin
author: Ellen Gethner
published in: Discrete Mathematics
publication date: 2010-10-18T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5801216
zbMATH Keywords: graph coloring
zbMATH Keywords: chromatic number
zbMATH Keywords: thickness
zbMATH Keywords: \(r\)-inflation
zbMATH Keywords: independence number
zbMATH Keywords: arboricity
MaRDI profile type: Publication
full work available at URL: j.disc.2010.04.019
OpenAlex ID: W2166226944
cites work: Q4111609
cites work: Every planar map is four colorable
cites work: A proof of the four color theorem
cites work: Every planar map is four colorable. II: Reducibility
cites work: Q3514485
cites work: Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs
cites work: Hajos' graph-coloring conjecture: Variations and counterexamples
cites work: Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
cites work: Star-extremal graphs and the lexicographic product
cites work: Some results on the Oberwolfach problem. (Decomposition of complete graphs into isomorphic quadratic factors.)
cites work: Q4820391
cites work: Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon
cites work: Q4857375
cites work: Decomposition of Finite Graphs Into Forests
cites work: Q5528475
cites work: On a special case of Hadwiger's conjecture
cites work: Q3261867
cites work: Q4340879
cites work: Some remarks on Hajós' conjecture
cites work: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
cites work: The Non-Biplanar Character of the Complete 9-Graph
cites work: Q5311854
DOI: 10.1016/J.DISC.2010.04.019
description: scientific article; zbMATH DE number 5801216