On packing S-colorings of subcubic graphs
From MaRDI portal
Publication:6157413
Recommendations
Cites work
- \(S\)-packing colorings of cubic graphs
- A note on \(S\)-packing colorings of lattices
- An infinite family of subcubic graphs with unbounded packing chromatic number
- Complexity of the packing coloring problem for trees
- Dichotomies properties on computational complexity of S-packing coloring problems
- scientific article; zbMATH DE number 2104737 (Why is no real title available?)
- On the packing chromatic number of subcubic outerplanar graphs
- Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
- Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
- Packing chromatic number of cubic graphs
- Packing chromatic number under local changes in a graph
- Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph
- Packing coloring of some undirected and oriented coronae graphs
- Packing colorings of subcubic outerplanar graphs
- The S-packing chromatic number of a graph
Cited in
(22)- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- Covering and packing in graphs. V. Mispacking subcubes in hypercubes
- On S-packing edge-colorings of cubic graphs
- Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
- Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
- Packing colorings of subcubic outerplanar graphs
- Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph
- On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs
- \(S\)-packing colorings of cubic graphs
- Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable
- A characterization of 4-_S-vertex-critical graphs for packing sequences with s₁ = 1 and s₂ 3
- About S-packing coloring of subcubic graphs
- About \(S\)-packing coloring of 3-irregular subcubic graphs
- On S-packing coloring of 2-saturated subcubic graphs
- S-packing chromatic critical graphs
- On S-packing colorings of subcubic graphs
- Claw-free cubic graphs are (1,1,2,2)-colorable
- Further results and questions on S-packing coloring of subcubic graphs
- Fast algorithm for S-packing coloring of Halin graphs
- On the (1, 1, 2, 3)-packing coloring of some subcubic graphs
- A short proof that every claw-free cubic graph is (1, 1, 2, 2)-packing colorable
- A step toward an S-packing coloring conjecture for subcubic graphs
This page was built for publication: On packing \(S\)-colorings of subcubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157413)