Hypergraph cooperative coloring
From MaRDI portal
Cites work
- A note on vertex list colouring
- An average degree condition for independent transversals
- Colorings, transversals, and local sparsity
- Cooperative coloring of some graph families
- Cooperative colorings and independent systems of representatives
- Cooperative colorings of forests
- Cooperative colorings of trees and of bipartite graphs
- Independent transversals in locally sparse graphs
- On the adaptable chromatic number of graphs
- Single-conflict colorings of degenerate graphs
- The colour theorems of Brooks and Gallai extended
This page was built for publication: Hypergraph cooperative coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262726)