Ore-type versions of Brooks' theorem
type: Item
instance of: scholarly article
title: Ore-type versions of Brooks' theorem
zbMATH Open document ID: 1198.05059
published in: Journal of Combinatorial Theory. Series B
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5523266
zbMATH Keywords: graph coloring
zbMATH Keywords: Brooks' theorem
zbMATH Keywords: edge degree
zbMATH Keywords: equitable coloring
author: H. A. Kierstead
author: Alexandr Kostochka
MaRDI profile type: Publication
full work available at URL: j.jctb.2008.06.007
OpenAlex ID: W2150871094
cites work: Spanning subgraphs of random graphs
cites work: Colorings and orientations of graphs
cites work: Almost \(H\)-factors in dense graphs
cites work: \(H\)-factors in dense graphs
cites work: Equitable coloring and the maximum degree
cites work: Some Theorems on Abstract Graphs
cites work: Q5732334
cites work: Q5620621
cites work: The infamous upper tail
cites work: A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
cites work: An Ore-type theorem on equitable coloring
cites work: Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
cites work: Proof of the Seymour conjecture for large graphs
cites work: On equitable \(\Delta\)-coloring of graphs with low average degree
cites work: Ore-type graph packing problems
cites work: On equitable coloring of bipartite graphs
cites work: Note on Hamilton Circuits
cites work: Q4780802
cites work: Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
cites work: Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs
cites work: Q4348809
cites work: Q4255998
DOI: 10.1016/J.JCTB.2008.06.007
description: scientific article; zbMATH DE number 5523266