The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs

DOI10.1016/j.dam.2022.06.039zbMath1497.05071OpenAlexW4284678842WikidataQ113877177 ScholiaQ113877177MaRDI QIDQ2172399

Lily Chen, Yanyi Li, Xiangqian Zhou

Publication date: 15 September 2022

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

Full work available at URL: https://doi.org/10.1016/j.dam.2022.06.039

zbMATH Keywords

bipartite graphsstrong edge-coloringinclusion-free edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
• The strong chromatic index of \((3,\Delta)\)-bipartite graphs
• On induced matchings
• A note on the strong chromatic index of bipartite graphs
• The strong chromatic index of a class of graphs
• Adjacent strong edge coloring of graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Strict neighbor-distinguishing index of subcubic graphs
• Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs