A refinement of a result of Corrádi and Hajnal
type: Item
instance of: scholarly article
title: A refinement of a result of Corrádi and Hajnal
zbMATH Open document ID: 1374.05091
published in: Combinatorica
publication date: 2017-03-31T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6699287
zbMATH Keywords: graph theory
zbMATH Keywords: graph coloring
author: H. A. Kierstead
author: Alexandr Kostochka
MaRDI profile type: Publication
full work available at URL: s00493-014-3059-6
OpenAlex ID: W1988551992
cites work: Spanning subgraphs of random graphs
cites work: \(H\)-factors in dense graphs
cites work: Q2735585
cites work: Equitable coloring and the maximum degree
cites work: On the maximal number of independent circuits in a graph
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: Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
cites work: A fast algorithm for equitable coloring
cites work: Q3656238
cites work: A list analogue of equitable coloring
cites work: On equitable \(\Delta\)-coloring of graphs with low average degree
cites work: On equitable coloring of bipartite graphs
cites work: Q4780802
cites work: Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
cites work: Q4716273
cites work: Perfect Graphs and an Application to Optimizing Municipal Services
cites work: Q4348809
cites work: Q4255998
DOI: 10.1007/S00493-014-3059-6
description: scientific article; zbMATH DE number 6699287