Hadwiger number and chromatic number for near regular degree sequences

DOI10.1002/jgt.20447zbMath1209.05098OpenAlexW4236482880MaRDI QIDQ3055914

Neil Robertson, Zi-Xia Song

Publication date: 10 November 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20447

zbMATH Keywords

chromatic numberHadwiger numbergraphic degree sequence

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem, A further result on the potential-Ramsey number of G1 and G2, The potential-Ramsey number of $K_n$ and $K_t^{-k}$, Extremal values of the chromatic number for a given degree sequence, Chromatic number and complete graph substructures for degree sequences, On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic, A new lower bound on the potential-Ramsey number of two graphs, A degree sequence variant of graph Ramsey numbers, Hadwiger's conjecture for degree sequences

Cites Work

• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Unnamed Item
• Unnamed Item