On equitable coloring of bipartite graphs
From MaRDI portal
Publication:1916388
DOI10.1016/0012-365X(94)00092-WzbMath0856.05040MaRDI QIDQ1916388
Publication date: 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00092-w
05C15: Coloring of graphs and hypergraphs
Related Items
Equitable coloring parameters of certain graph classes, Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms, On equitable coloring of corona of wheels, Equitable chromatic number of weak modular product of Some graphs, On Equitable List Arboricity of Graphs, Equitable list vertex colourability and arboricity of grids, On certain parameters of equitable coloring of graphs, On the equitable chromatic number of complete \(n\)-partite graphs, Equitable oriented coloring, Equitable critical graphs, A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS, Extremal numbers for disjoint copies of a clique, 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, 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 coloring on total graph of bigraphs and central graph of cycles and paths, 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 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, Sharpening an ore-type version of the Corrádi-Hajnal theorem, 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 the equitable choosability of complete bipartite graphs, On list equitable total colorings of the generalized theta graph, On the equitable choosability of the disjoint union of stars, 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, On Equitable Coloring of Central Graphs and Total Graphs, Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring, On equitable colouring of Knödel graphs, EQUITABLE COLORING OF 2-DEGENERATE GRAPH AND PLANE GRAPHS WITHOUT CYCLES OF SPECIFIC LENGTHS
Cites Work
