Chromatic number and complete graph substructures for degree sequences

DOI10.1007/s00493-013-2649-zzbMath1313.05117arXiv0907.1583OpenAlexW2166183308MaRDI QIDQ485549

Zdeněk Dvořák, Bojan Mohar

Publication date: 9 January 2015

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0907.1583

zbMATH Keywords

degree sequenceclique minorchromatic number of a graphclique subdivision

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (9)

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 ⋮ 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 ⋮ Stability of the Potential Function ⋮ A degree sequence variant of graph Ramsey numbers ⋮ Hadwiger's conjecture for degree sequences

Cites Work

• Rao's degree sequence conjecture
• Graph minors. XX: Wagner's conjecture
• Some remarks on Hajós' conjecture
• Hajós' conjecture for line graphs
• Hajos' graph-coloring conjecture: Variations and counterexamples
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
• Hadwiger number and chromatic number for near regular degree sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chromatic number and complete graph substructures for degree sequences