Equitable coloring and the maximum degree

From MaRDI portal
Publication:1337614

DOI10.1006/eujc.1994.1047zbMath0809.05050OpenAlexW2041206070MaRDI QIDQ1337614

Bor-Liang Chen, Pou-Lin Wu, Ko-Wei Lih

Publication date: 30 November 1994

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1994.1047




Related Items (61)

Equitable chromatic number of weak modular product of Some graphsOn the equitable total chromatic number of cubic graphsOn bipartization of cubic graphs by removal of an independent setThe strong equitable vertex 2-arboricity of complete bipartite and tripartite graphsEvery 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-ColoringEquitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphsEquitable coloring parameters of certain graph classesEquitable coloring and equitable choosability of graphs with small maximum average degreeOn the Corrádi-Hajnal theorem and a question of DiracEQUITABLE CHROMATIC NUMBER OF SOME WHEEL RELATED GRAPHSEquitable clique-coloring in claw-free graphs with maximum degree at most 4On Equitable List Arboricity of GraphsEquitable colorings of Kronecker products of graphsDisjoint cycles and chorded cycles in a graph with given minimum degreeEquitable and equitable list colorings of graphsEquitable colorings of corona multiproducts of graphsEquitable vertex arboricity of 5-degenerate graphsA greedy algorithm for the social golfer and the Oberwolfach problemEquitable and list equitable colorings of planar graphs without 4-cyclesEquitable colorings of planar graphs without short cyclesEquitable vertex arboricity of graphsScheduling of unit-length jobs with cubic incompatibility graphs on three uniform machinesSharpening an ore-type version of the Corrádi-Hajnal theoremEquitable \(\Delta\)-coloring of graphsA Short Proof of the Hajnal–Szemerédi Theorem on Equitable ColouringA note on relaxed equitable coloring of graphsExtremal numbers for disjoint copies of a cliqueTight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphsOn certain parameters of equitable coloring of graphsEquivalence of two conjectures on equitable coloring of graphsThe equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\)An Ore-type theorem on equitable coloringEquitable coloring planar graphs with large girthEquitable list colorings of planar graphs without short cyclesA refinement of a result of Corrádi and HajnalEquitable coloring of three classes of 1-planar graphsTotal equitable list coloringEQUITABLE COLORING OF 2-DEGENERATE GRAPH AND PLANE GRAPHS WITHOUT CYCLES OF SPECIFIC LENGTHSOn equitable and equitable list colorings of series-parallel graphsEquitable versus nearly equitable coloring and the Chen-Lih-Wu ConjectureEquitable partition of planar graphsOn the equitable chromatic number of complete \(n\)-partite graphsTheoretical aspects of equitable partition of networks into sparse modulesOn equitable colorings of sparse graphsEquitable coloring of some convex polytope graphsOre-type versions of Brooks' theoremA note on the equitable choosability of complete bipartite graphsEquitable total coloring of corona of cubic graphsOn list equitable total colorings of the generalized theta graphEquitable coloring of Kronecker products of complete multipartite graphs and complete graphsEquitable and semi-equitable coloring of cubic graphs and its application in batch schedulingEquitable Coloring of Graphs. Recent Theoretical Results and New Practical AlgorithmsEquitable defective coloring of sparse planar graphsEquitable colorings of planar graphs with maximum degree at least nineEquitable colorings of Cartesian products of graphsProportional choosability: a new list analogue of equitable coloringOn the equitable choosability of the disjoint union of starsEquitable total-coloring of subcubic graphsEquitable colourings of Borel graphsEquitable list-coloring for \(C_{5}\)-free plane graphs without adjacent trianglesOn equitable \(\Delta\)-coloring of graphs with low average degree




This page was built for publication: Equitable coloring and the maximum degree