Proper edge-colorings with a rich neighbor requirement

DOI10.1016/j.disc.2023.113803MaRDI QIDQ6177411

Mirko Petruševski, Riste Škrekovski

Publication date: 17 January 2024

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

zbMATH Keywords

subcubic graphstrong edge-coloringneighborproper edge-coloringrich edge

Mathematics Subject Classification ID

Graph theory (05Cxx) Designs and configurations (05Bxx) Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong chromatic index of subcubic planar multigraphs
• On induced matchings
• The strong chromatic index of a cubic graph is at most 10
• Colouring graphs with sparse neighbourhoods: bounds and applications
• On Graphic-Minimal Spaces
• Induced matchings in cubic graphs
• Normal edge‐colorings of cubic graphs
• Strong edge colorings of graphs and the covers of Kneser graphs

This page was built for publication: Proper edge-colorings with a rich neighbor requirement