Polynomial instances of the packing coloring problem
From MaRDI portal
Recommendations
- Polynomial cases for the vertex coloring problem
- scientific article; zbMATH DE number 4089573
- Notes on complexity of packing coloring
- Polynomial graph-colorings
- Polynomial graph-colorings
- Packing colouring of some classes of cubic graphs
- Polychromatic colorings on the integers
- Polynomial-time approximation algorithms for the coloring problem in some cases
- Packing polynomials on multidimensional integer sectors
- A survey on packing colorings
Cites work
- Broadcast chromatic numbers of graphs
- Complexity of the packing coloring problem for trees
- scientific article; zbMATH DE number 2104737 (Why is no real title available?)
- On graphs with limited number of \(P_{4}\)-partners
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- On the packing chromatic number of some lattices
- Recognizing P₄ -Sparse Graphs in Linear Time
Cited in
(8)- Notes on complexity of packing coloring
- Packing coloring of some undirected and oriented coronae graphs
- Dichotomies properties on computational complexity of S-packing coloring problems
- Broadcast chromatic numbers of graphs
- The packing coloring problem for (q,q-4) graphs
- Complexity of the Packing Coloring Problem for Trees
- On uniquely packable trees
- Complexity of the packing coloring problem for trees
This page was built for publication: Polynomial instances of the packing coloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840736)
