Pages that link to "Item:Q1301634"
From MaRDI portal
The following pages link to Split and balanced colorings of complete graphs (Q1301634):
Displaying 15 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)
- Heterochromatic tree partition numbers for complete bipartite graphs (Q932639) (← links)
- Adaptable chromatic number of graph products (Q1045010) (← links)
- Adaptable choosability of planar graphs with sparse short cycles (Q1045097) (← links)
- Chromatic capacities of graphs and hypergraphs (Q1827711) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Chromatic capacity and graph operations (Q2483394) (← links)
- The Adaptable Chromatic Number and the Chromatic Number (Q2958198) (← links)
- On splittable colorings of graphs and hypergraphs (Q3150170) (← links)
- Adapted list coloring of planar graphs (Q3652546) (← links)
- An asymptotically tight bound on the adaptable chromatic number (Q4650185) (← links)
- Adaptable and conflict colouring multigraphs with no cycles of length three or four (Q6047975) (← links)
- Problems close to my heart (Q6116410) (← links)
