Cooperative coloring of some graph families
From MaRDI portal
Publication:6542008
Recommendations
- Cooperative colorings of trees and of bipartite graphs
- Cooperative colorings of forests
- Cooperative colorings and independent systems of representatives
- Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings
- Bounds on vertex colorings with restrictions on the union of color classes
Cites work
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- A note on vertex list colouring
- Adapted List Coloring of Graphs and Hypergraphs
- Adapted list coloring of planar graphs
- An asymptotically tight bound on the adaptable chromatic number
- Cooperative colorings and independent systems of representatives
- Cooperative colorings of forests
- Cooperative colorings of trees and of bipartite graphs
- Graph colouring and the probabilistic method
- Graph theory
- Independent systems of representatives in weighted graphs
- Independent transversals in locally sparse graphs
- On the adaptable chromatic number of graphs
- The Adaptable Chromatic Number and the Chromatic Number
- The independence number of graphs with a forbidden cycle and Ramsey numbers
Cited in
(2)
This page was built for publication: Cooperative coloring of some graph families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542008)