On \(S\)-packing edge-colorings of graphs with small edge weight

DOI10.1016/j.amc.2021.126840OpenAlexW4200295688MaRDI QIDQ2073113

Baoyindureng Wu, Wei Yang

Publication date: 27 January 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2021.126840

zbMATH Keywords

strong edge coloringedge weight\(S\)-packing edge-coloring

Mathematics Subject Classification ID

Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• \(S\)-packing colorings of cubic graphs
• Packing chromatic number under local changes in a graph
• The strong chromatic index of \((3,\Delta)\)-bipartite graphs
• A note on the strong chromatic index of bipartite graphs
• Complexity of the packing coloring problem for trees
• On the packing chromatic number of some lattices
• Incidence and strong edge colorings of graphs
• Adjacent strong edge coloring of graphs
• Packing chromatic number of cubic graphs
• On the packing chromatic number of subcubic outerplanar graphs
• On \(S\)-packing edge-colorings of cubic graphs
• On parsimonious edge-colouring of graphs with maximum degree three
• Packing chromatic number of base-3 Sierpiński graphs
• A note on \(S\)-packing colorings of lattices
• The S-packing chromatic number of a graph