Cooperative coloring of some graph families
From MaRDI portal
Publication:6542008
DOI10.1016/J.DISC.2024.113973zbMATH Open1539.05031MaRDI QIDQ6542008FDOQ6542008
Authors: Xu Qing Bai, Bi Li, Chuandong Xu, Xin Zhang
Publication date: 21 May 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
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
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)
Cites Work
- Graph theory
- Graph colouring and the probabilistic method
- Title not available (Why is that?)
- On the adaptable chromatic number of graphs
- Adapted List Coloring of Graphs and Hypergraphs
- Adapted list coloring of planar graphs
- Independent systems of representatives in weighted graphs
- The independence number of graphs with a forbidden cycle and Ramsey numbers
- The Adaptable Chromatic Number and the Chromatic Number
- An asymptotically tight bound on the adaptable chromatic number
- Independent transversals in locally sparse graphs
- A note on vertex list colouring
- Cooperative colorings of trees and of bipartite graphs
- Cooperative colorings and independent systems of representatives
- Cooperative colorings of forests
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)