Pages that link to "Item:Q1827711"
From MaRDI portal
The following pages link to Chromatic capacities of graphs and hypergraphs (Q1827711):
Displaying 13 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)
- 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)
- Capacities of graphs and \(2\)-matchings (Q1584259) (← links)
- On color critical graphs with large adaptable chromatic numbers (Q1684934) (← links)
- Hofer-Zehnder capacity and Bruhat graph (Q2175873) (← 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)
- An asymptotically tight bound on the adaptable chromatic number (Q4650185) (← links)
- On the Chromatic Thresholds of Hypergraphs (Q5366886) (← links)