Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs

DOI10.1016/j.disc.2015.08.026zbMath1322.05055arXiv1412.2624OpenAlexW1942599361MaRDI QIDQ501082

Aurélie Lagoutte, Petru Valicov, Julien Bensmail

Publication date: 8 October 2015

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

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

zbMATH Keywords

complexitybipartite graphsstrong edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Strong edge coloring sparse graphs ⋮ The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs ⋮ Hypergraph incidence coloring ⋮ The strong chromatic index of \((3,\Delta)\)-bipartite graphs ⋮ On incidence choosability of cubic graphs ⋮ Recent progress on strong edge-coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On induced matchings
• A note on the strong chromatic index of bipartite graphs
• The strong chromatic index of a cubic graph is at most 10
• Incidence and strong edge colorings of graphs
• A bound on the strong chromatic index of a graph
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Graph Bipartization and via minimization
• Induced matchings in cubic graphs

This page was built for publication: Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs