Between Proper and Strong Edge-Colorings of Subcubic Graphs

DOI10.1007/978-3-030-48966-3_27OpenAlexW3016618681MaRDI QIDQ5041205

Borut Lužar, Hervé Hocquard, Dimitri Lajou

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

induced matchingstrong edge-coloring\(S\)-packing edge-coloring

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (3)

Between proper and strong edge‐colorings of subcubic graphs ⋮ Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable ⋮ Strong edge colorings of graphs and the covers of Kneser graphs

Cites Work

• 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
• Colouring graphs with sparse neighbourhoods: bounds and applications
• On parsimonious edge-colouring of graphs with maximum degree three
• The S-packing chromatic number of a graph
• Combinatorial Nullstellensatz
• Induced matchings in cubic graphs

This page was built for publication: Between Proper and Strong Edge-Colorings of Subcubic Graphs