Bounds on vertex colorings with restrictions on the union of color classes
From MaRDI portal
Publication:3083409
Recommendations
Cites work
- Acyclic coloring of graphs
- Acyclic colorings of planar graphs
- Bounds on edge colorings with restrictions on the union of color classes
- Colouring a graph frugally
- Colouring graphs with bounded generalized colouring number
- Discrete Mathematics
- Excluding any graph as a minor allows a low tree-width 2-coloring
- Forbidden subgraph colorings and the oriented chromatic number
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. X: Obstructions to tree-decomposition
- Graph searching and a min-max theorem for tree-width
- Radiocoloring in planar graphs: Complexity and approximations
- Star coloring of graphs
- Steiner trees, partial 2–trees, and minimum IFI networks
- Tree-depth, subgraph coloring and homomorphism bounds
Cited in
(6)- Intersection dimension and graph invariants
- Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings
- Star coloring of graphs with girth at least five
- Bounds on edge colorings with restrictions on the union of color classes
- Improved bounds for centered colorings
- Cooperative coloring of some graph families
This page was built for publication: Bounds on vertex colorings with restrictions on the union of color classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083409)