A note on the strong chromatic index of bipartite graphs

DOI10.1016/j.disc.2007.07.034zbMath1155.05026OpenAlexW2085014006MaRDI QIDQ932702

Kittikorn Nakprasit

Publication date: 11 July 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.034

zbMATH Keywords

bipartite graphinduced matchingstrong edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (16)

The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs ⋮ The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs ⋮ List strong edge-colorings of sparse graphs ⋮ Hypergraph incidence coloring ⋮ On the complexity of the flow coloring problem ⋮ Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs ⋮ The strong chromatic index of \((3,\Delta)\)-bipartite graphs ⋮ On incidence choosability of cubic graphs ⋮ Strong Chromatic Index of 2-Degenerate Graphs ⋮ On star edge colorings of bipartite and subcubic graphs ⋮ Injective edge-coloring of graphs with given maximum degree ⋮ Strong edge-coloring for jellyfish graphs ⋮ 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

• On induced matchings
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Induced matchings in bipartite graphs
• The strong chromatic index of a cubic graph is at most 10
• Incidence and strong edge colorings of graphs
• Strong chromatic index of subset graphs
• Induced matchings in cubic graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the strong chromatic index of bipartite graphs