Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs
From MaRDI portal
Publication:5450347
DOI10.1002/jgt.20282zbMath1136.05044OpenAlexW4231490970MaRDI QIDQ5450347
Thom Sulanke, Ellen Gethner, Debra L. Boutin
Publication date: 20 March 2008
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20282
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
The thickness and chromatic number of \(r\)-inflated graphs, Defective and clustered choosability of sparse graphs, Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs, Some Conjectures and Questions in Chromatic Topological Graph Theory
Uses Software
Cites Work