Equitable coloring and the maximum degree
From MaRDI portal
Publication:1337614
DOI10.1006/eujc.1994.1047zbMath0809.05050MaRDI 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
05C15: Coloring of graphs and hypergraphs
Related Items
Equitable coloring parameters of certain graph classes, Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling, Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms, Equitable colourings of Borel graphs, Equitable chromatic number of weak modular product of Some graphs, EQUITABLE CHROMATIC NUMBER OF SOME WHEEL RELATED GRAPHS, On Equitable List Arboricity of Graphs, On certain parameters of equitable coloring of graphs, On the equitable chromatic number of complete \(n\)-partite graphs, Extremal numbers for disjoint copies of a clique, On the equitable total chromatic number of cubic graphs, On bipartization of cubic graphs by removal of an independent set, The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs, Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs, On the Corrádi-Hajnal theorem and a question of Dirac, Equitable and list equitable colorings of planar graphs without 4-cycles, Equitable vertex arboricity of graphs, Equitable \(\Delta\)-coloring of graphs, A refinement of a result of Corrádi and Hajnal, On equitable and equitable list colorings of series-parallel graphs, Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture, Equitable colorings of Kronecker products of graphs, Equitable and equitable list colorings of graphs, On equitable colorings of sparse graphs, Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs, Equitable defective coloring of sparse planar graphs, Equitable colorings of planar graphs with maximum degree at least nine, Equitable colorings of Cartesian products of graphs, On equitable \(\Delta\)-coloring of graphs with low average degree, Equitable list colorings of planar graphs without short cycles, Ore-type versions of Brooks' theorem, Equitable coloring and equitable choosability of graphs with small maximum average degree, Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines, Sharpening an ore-type version of the Corrádi-Hajnal theorem, Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs, Equitable coloring of three classes of 1-planar graphs, Total equitable list coloring, Equitable coloring of some convex polytope graphs, Equitable colorings of planar graphs without short cycles, A note on relaxed equitable coloring of graphs, Equivalence of two conjectures on equitable coloring of graphs, Equitable partition of planar graphs, Theoretical aspects of equitable partition of networks into sparse modules, A note on the equitable choosability of complete bipartite graphs, Equitable total coloring of corona of cubic graphs, On list equitable total colorings of the generalized theta graph, On the equitable choosability of the disjoint union of stars, Disjoint cycles and chorded cycles in a graph with given minimum degree, Proportional choosability: a new list analogue of equitable coloring, Equitable total-coloring of subcubic graphs, Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles, Equitable colorings of corona multiproducts of graphs, Equitable vertex arboricity of 5-degenerate graphs, The equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\), An Ore-type theorem on equitable coloring, Equitable coloring planar graphs with large girth, Equitable clique-coloring in claw-free graphs with maximum degree at most 4, A greedy algorithm for the social golfer and the Oberwolfach problem, Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring, A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring, EQUITABLE COLORING OF 2-DEGENERATE GRAPH AND PLANE GRAPHS WITHOUT CYCLES OF SPECIFIC LENGTHS
