Pages that link to "Item:Q1972130"
From MaRDI portal
The following pages link to On the upper chromatic numbers of the reals (Q1972130):
Displaying 16 items.
- A lower bound for the chromatic capacity in terms of the chromatic number of a graph (Q390289) (← links)
- Adapted game colouring of graphs (Q412230) (← links)
- The adaptable choosability number grows with the choosability number (Q641204) (← links)
- On a construction of graphs with high chromatic capacity and large girth (Q708406) (← links)
- Adaptable chromatic number of graph products (Q1045010) (← links)
- Adaptable choosability of planar graphs with sparse short cycles (Q1045097) (← links)
- On color critical graphs with large adaptable chromatic numbers (Q1684934) (← links)
- A certain 2-coloring of the reals (Q1704500) (← links)
- Chromatic capacities of graphs and hypergraphs (Q1827711) (← links)
- Chromatic capacity and graph operations (Q2483394) (← links)
- The Adaptable Chromatic Number and the Chromatic Number (Q2958198) (← links)
- Adapted list coloring of planar graphs (Q3652546) (← links)
- (Q4504215) (← links)
- An asymptotically tight bound on the adaptable chromatic number (Q4650185) (← links)
- On the Babai and Upper Chromatic Numbers of Graphs of Diameter 2 (Q5016460) (← links)
- Adaptable and conflict colouring multigraphs with no cycles of length three or four (Q6047975) (← links)
