Revisiting semistrong edge‐coloring of graphs

DOI10.1002/jgt.23059arXiv2208.13297OpenAlexW4388913663MaRDI QIDQ6199384

Roman Soták, Martina Mockovčiaková, Borut Lužar

Publication date: 23 February 2024

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

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

zbMATH Keywords

induced matchingstrong edge-coloringsemistrong chromatic indexsemistrong edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• On \((s,t)\)-relaxed strong edge-coloring of graphs
• Problems and results in combinatorial analysis and graph theory
• A bound on the strong chromatic index of a graph
• Degenerate matchings and edge colorings
• The minimum forcing number of perfect matchings in the hypercube
• Generalized subgraph-restricted matchings in graphs
• Colouring graphs with sparse neighbourhoods: bounds and applications
• Strong chromatic index of subset graphs
• A Stronger Bound for the Strong Chromatic Index
• Semistrong edge coloring of graphs
• On Representatives of Subsets
• 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: Revisiting semistrong edge‐coloring of graphs