The strong chromatic index of \((3,\Delta)\)-bipartite graphs

DOI10.1016/j.disc.2016.10.016zbMath1357.05043arXiv1806.07017OpenAlexW2556067267MaRDI QIDQ512620

Xiangqian Zhou, Mingfang Huang, Gexin Yu

Publication date: 27 February 2017

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

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

zbMATH Keywords

bipartite graphinduced matchingstrong 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 (10)

The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs ⋮ Strong chromatic index of graphs with maximum degree four ⋮ List strong edge-colorings of sparse graphs ⋮ Hypergraph incidence coloring ⋮ On incidence choosability of cubic graphs ⋮ Injective edge-coloring of graphs with given maximum degree ⋮ The strong edge-coloring for graphs with small edge weight ⋮ On \(S\)-packing edge-colorings of graphs with small edge weight ⋮ Recent progress on strong edge-coloring of graphs ⋮ Strong edge coloring of Cayley graphs and some product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
• On induced matchings
• A note on the strong chromatic index of bipartite graphs
• Incidence and strong edge colorings of graphs

This page was built for publication: The strong chromatic index of \((3,\Delta)\)-bipartite graphs