On the upper chromatic numbers of the reals

DOI10.1016/S0012-365X(99)00219-8zbMath0957.05039OpenAlexW1976168173WikidataQ127207299 ScholiaQ127207299MaRDI QIDQ1972130

Aaron Archer

Publication date: 23 March 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00219-8

zbMATH Keywords

chromatic capacitycompatible vertex coloringedge-colored multigraphupper chromatic numbers

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (14)

A lower bound for the chromatic capacity in terms of the chromatic number of a graph ⋮ On color critical graphs with large adaptable chromatic numbers ⋮ Adaptable and conflict colouring multigraphs with no cycles of length three or four ⋮ Adapted game colouring of graphs ⋮ The Adaptable Chromatic Number and the Chromatic Number ⋮ The adaptable choosability number grows with the choosability number ⋮ An asymptotically tight bound on the adaptable chromatic number ⋮ Chromatic capacity and graph operations ⋮ On a construction of graphs with high chromatic capacity and large girth ⋮ 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 the Babai and Upper Chromatic Numbers of Graphs of Diameter 2

This page was built for publication: On the upper chromatic numbers of the reals