Split and balanced colorings of complete graphs
From MaRDI portal
Publication:1301634
DOI10.1016/S0012-365X(98)00323-9zbMath0931.05031OpenAlexW2063113036MaRDI QIDQ1301634
Publication date: 16 February 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00323-9
Related Items
A lower bound for the chromatic capacity in terms of the chromatic number of a graph, Adaptable and conflict colouring multigraphs with no cycles of length three or four, Adapted game colouring of graphs, Problems close to my heart, The Adaptable Chromatic Number and the Chromatic Number, The adaptable choosability number grows with the choosability number, Heterochromatic tree partition numbers for complete bipartite graphs, An asymptotically tight bound on the adaptable chromatic number, Recognition of split-graphic sequences, Chromatic capacity and graph operations, Chromatic capacities of graphs and hypergraphs, Adapted list coloring of planar graphs, Adaptable chromatic number of graph products, Adaptable choosability of planar graphs with sparse short cycles, On splittable colorings of graphs and hypergraphs
Cites Work
