Complexity of the packing coloring problem for trees
From MaRDI portal
(Redirected from Publication:972338)
Recommendations
- Complexity of the Packing Coloring Problem for Trees
- Dichotomies properties on computational complexity of S-packing coloring problems
- Packing problems in edge-colored graphs
- Notes on complexity of packing coloring
- The packing coloring problem for \((q,q-4)\) graphs
- Broadcast chromatic numbers of graphs
- Polynomial instances of the packing coloring problem
- Graph packings
- A survey on packing colorings
- The packing coloring problem for lobsters and partner limited graphs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- scientific article; zbMATH DE number 2104737 (Why is no real title available?)
- Broadcast chromatic numbers of graphs
- Easy problems for tree-decomposable graphs
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
Cited in
(49)- Packing colorings of subcubic outerplanar graphs
- An infinite family of subcubic graphs with unbounded packing chromatic number
- The packing chromatic number of hypercubes
- Facial packing vertex-coloring of subdivided plane graphs
- A survey on packing colorings
- The complexity of the node capacitated in-tree packing problem
- Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
- Independence, matching and packing coloring of the iterated Mycielskian of graphs
- The exponential growth of the packing chromatic number of iterated Mycielskians
- Packing chromatic number of certain fan and wheel related graphs
- Complexity of the Packing Coloring Problem for Trees
- A study on packing coloring of fan and jump graph families
- Packing chromatic number versus chromatic and clique number
- \(S\)-packing chromatic vertex-critical graphs
- Packing coloring of Sierpiński-type graphs
- A lower bound for the packing chromatic number of the Cartesian product of cycles
- On \(S\)-packing edge-colorings of cubic graphs
- Packing chromatic number of subdivisions of cubic graphs
- A note on \(S\)-packing colorings of lattices
- Packing chromatic number of distance graphs
- Packing chromatic numbers of finite super subdivisions of graphs
- Independence number and packing coloring of generalized Mycielski graphs
- A note on the packing chromatic number of lexicographic products
- On packing coloring of helm related graphs
- On the packing chromatic number of subcubic outerplanar graphs
- The packing coloring problem for lobsters and partner limited graphs
- A survey and classification of Sierpiński-type graphs
- On \(S\)-packing edge-colorings of graphs with small edge weight
- Facial packing edge-coloring of plane graphs
- Broadcast chromatic numbers of graphs
- A new approach on locally checkable problems
- Notes on complexity of packing coloring
- On uniquely packable trees
- The packing coloring of distance graphs \(D(k,t)\)
- Modeling the packing coloring problem of graphs
- On packing colorings of distance graphs
- Packing chromatic number of base-3 Sierpiński graphs
- Polynomial instances of the packing coloring problem
- The packing chromatic number of the infinite square lattice is between 13 and 15
- On packing \(S\)-colorings of subcubic graphs
- Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
- Packing chromatic number under local changes in a graph
- Dichotomies properties on computational complexity of \(S\)-packing coloring problems
- \(S\)-packing colorings of cubic graphs
- The packing chromatic number of infinite product graphs
- The packing coloring problem for \((q,q-4)\) graphs
- Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
- Graphs that are critical for the packing chromatic number
- Packing chromatic number of cubic graphs
This page was built for publication: Complexity of the packing coloring problem for trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972338)
