Between proper and strong edge‐colorings of subcubic graphs

DOI10.1002/jgt.22848zbMath1522.05121OpenAlexW3095299223MaRDI QIDQ6046648

Dimitri Lajou, Borut Lužar, Hervé Hocquard

Publication date: 5 October 2023

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

Full work available at URL: https://doi.org/10.1002/jgt.22848

zbMATH Keywords

induced matchingstrong 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)

Related Items (2)

Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable ⋮ Revisiting semistrong edge‐coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong chromatic index of subcubic planar multigraphs
• On induced matchings
• The strong chromatic index of a class of graphs
• On Tutte's extension of the four-colour problem
• The strong chromatic index of a cubic graph is at most 10
• Adjacent strong edge coloring of graphs
• On \(S\)-packing edge-colorings of cubic graphs
• The incidence coloring conjecture for graphs of maximum degree 3
• Parsimonious edge coloring
• Snarks without small cycles
• On parsimonious edge-colouring of graphs with maximum degree three
• The S-packing chromatic number of a graph
• Beyond the Vizing's Bound for at Most Seven Colors
• Combinatorial Nullstellensatz
• Induced matchings in cubic 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: Between proper and strong edge‐colorings of subcubic graphs