Strong edge-coloring of pseudo-Halin graphs

DOI10.1007/S40840-019-00718-8zbMath1433.05124OpenAlexW2909938166WikidataQ128685231 ScholiaQ128685231MaRDI QIDQ2302063

Jian-Bo Lv, Xiangwen Li

Publication date: 25 February 2020

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-019-00718-8

zbMATH Keywords

Halin graphsstrong chromatic indexstrong edge-coloringpseudo-Halin graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (1)

Proof of a conjecture on the strong chromatic index of Halin graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stronger bound for the strong chromatic index (extended abstract)
• Strong edge-coloring for cubic Halin graphs
• The strong chromatic index of Halin graphs
• On the strong chromatic index of cubic Halin graphs
• Strong edge-colouring of sparse planar graphs
• Strong chromatic index of subcubic planar multigraphs
• Strong edge colouring of subcubic graphs
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• On strong edge-colouring of subcubic graphs
• Induced matchings in cubic graphs
• Precise upper bound for the strong edge chromatic number of sparse planar graphs
• Strong edge-coloring of planar graphs

This page was built for publication: Strong edge-coloring of pseudo-Halin graphs