Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable

DOI10.1002/jgt.23004zbMath1526.05051arXiv2206.15046MaRDI QIDQ6062875

Taylor Short, Xujun Liu, Michael Santana

Publication date: 6 November 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.15046

zbMATH Keywords

subcubic graphsstrong edge-coloring\(S\)-packing edge-coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• \(S\)-packing colorings of cubic graphs
• Strong chromatic index of subcubic planar multigraphs
• Packing chromatic number under local changes in a graph
• On induced matchings
• The packing chromatic number of infinite product graphs
• The strong chromatic index of a cubic graph is at most 10
• A bound on the strong chromatic index of a graph
• Strong edge-coloring for planar graphs with large girth
• An infinite family of subcubic graphs with unbounded packing chromatic number
• Strong chromatic index of graphs with maximum degree four
• Packing chromatic number of cubic graphs
• On \(S\)-packing edge-colorings of cubic graphs
• Packing chromatic number of subdivisions of cubic graphs
• Strong edge-colorings of sparse graphs with large maximum degree
• Induced matchings in cubic graphs
• Between Proper and Strong Edge-Colorings of Subcubic Graphs
• The Strong Chromatic Index of Random Graphs
• Between proper and strong edge‐colorings of subcubic graphs
• Strong edge colorings of graphs and the covers of Kneser graphs

This page was built for publication: Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable