On packing S-colorings of subcubic graphs

DOI10.1016/J.DAM.2023.03.001MaRDI QIDQ6157413zbMATH OpenFDO

Authors Wei Yang, Baoyindureng Wu

Publication date 11 May 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

outerplanar graphssubcubic graphspacking \(S\)-coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• \(S\)-packing colorings of cubic graphs
• Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
• Packing colorings of subcubic outerplanar graphs
• Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
• On \(S\)-packing edge-colorings of cubic graphs

Cites work

• scientific article; zbMATH DE number 2104737 (Why is no real title available?)
• 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
• 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
• \(S\)-packing colorings of cubic graphs

Cited in

(14)

• \(S\)-packing colorings of cubic graphs
• Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
• Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable
• Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
• On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs
• About \(S\)-packing coloring of 3-irregular subcubic graphs
• Covering and packing in graphs. V. Mispacking subcubes in hypercubes
• On \(S\)-packing edge-colorings of cubic graphs
• A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\)
• About \(S\)-packing coloring of subcubic graphs
• Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph
• On \(S\)-packing coloring of 2-saturated subcubic graphs
• Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
• Packing colorings of subcubic outerplanar 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)