Strong edge-coloring for jellyfish graphs

DOI10.1016/j.disc.2015.04.031zbMath1318.05025OpenAlexW824136475MaRDI QIDQ2515576

Chia-Man Hung, Sheng-Hua Chen, Huei-Ling Lai, Chi-Yun Hsu, Gerard Jennhwa Chang

Publication date: 5 August 2015

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

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

zbMATH Keywords

cycleblockcactusstrong chromatic indexstrong edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

On the precise value of the strong chromatic index of a planar graph with a large girth ⋮ Unnamed Item ⋮ Recent progress on strong edge-coloring of graphs ⋮ Strong edge coloring of Cayley graphs and some product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong edge-coloring for cubic Halin graphs
• The strong chromatic index of Halin graphs
• On the strong chromatic index of cubic Halin graphs
• Strong chromatic index of planar graphs with large girth
• A note on the strong chromatic index of bipartite graphs
• The strong chromatic index of a class of graphs
• The strong chromatic index of complete cubic Halin graphs
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• Induced matchings
• Incidence and strong edge colorings of graphs
• A bound on the strong chromatic index of a graph
• On the computational complexity of strong edge coloring
• The incidence coloring conjecture for graphs of maximum degree 3
• A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
• New results on induced matchings
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• The strong chromatic index ofC4-free graphs
• Induced matchings in cubic graphs
• Strong Chromatic Index of 2-Degenerate Graphs

This page was built for publication: Strong edge-coloring for jellyfish graphs