On packing S-colorings of subcubic graphs

DOI10.1016/J.DAM.2023.03.001zbMATH Open1512.05149MaRDI QIDQ6157413FDOQ6157413

Authors: Wei Yang, Baoyindureng Wu 

Publication date: 11 May 2023

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

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

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)

Cites Work

• Packing chromatic number of cubic graphs
• Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
• Packing colorings of subcubic outerplanar graphs
• Dichotomies properties on computational complexity of \(S\)-packing coloring problems
• A note on \(S\)-packing colorings of lattices
• The \(S\)-packing chromatic number of a graph
• \(S\)-packing colorings of cubic graphs
• Complexity of the packing coloring problem for trees
• Title not available (Why is that?)
• Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
• Packing chromatic number under local changes in a graph
• An infinite family of subcubic graphs with unbounded packing chromatic number
• On the packing chromatic number of subcubic outerplanar graphs
• Packing coloring of some undirected and oriented coronae graphs
• Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs

Cited In (14)

• \(S\)-packing colorings of cubic graphs
• Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable
• Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
• 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
• 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
• On \(S\)-packing edge-colorings of cubic graphs
• On \(S\)-packing coloring of 2-saturated subcubic graphs
• Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph
• 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)