Proof of a conjecture on the strong chromatic index of Halin graphs
type: Item
instance of: scholarly article
title: Proof of a conjecture on the strong chromatic index of Halin graphs
zbMATH Open document ID: 1469.05061
author: Baoyindureng Wu
author: Wei Yang
published in: Discrete Applied Mathematics
publication date: 2021-08-02T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 7377182
zbMATH Keywords: strong edge coloring
zbMATH Keywords: strong chromatic index
zbMATH Keywords: Halin graph
MaRDI profile type: Publication
full work available at URL: j.dam.2021.06.016
OpenAlex ID: W3184393062
Wikidata QID: Q113877229
cites work: The strong chromatic index of a cubic graph is at most 10
cites work: Strong edge-colouring of sparse planar graphs
cites work: Q3097395
cites work: Precise upper bound for the strong edge chromatic number of sparse planar graphs
cites work: A stronger bound for the strong chromatic index (extended abstract)
cites work: Induced matchings
cites work: Strong edge-coloring for cubic Halin graphs
cites work: The strong chromatic index of graphs with edge weight eight
cites work: The strong edge-coloring for graphs with small edge weight
cites work: Strong edge-coloring of graphs with maximum degree 4 using 22 colors
cites work: Strong chromatic index of unit distance graphs
cites work: Problems and results in combinatorial analysis and graph theory
cites work: Q5752590
cites work: Q3320410
cites work: New results on induced matchings
cites work: On strong edge-colouring of subcubic graphs
cites work: Strong edge colouring of subcubic graphs
cites work: Q3201075
cites work: Induced matchings in cubic graphs
cites work: Upper bounds for the strong chromatic index of Halin graphs
cites work: Strong chromatic index of graphs with maximum degree four
cites work: Strong edge-coloring of planar graphs
cites work: Strong chromatic index of subcubic planar multigraphs
cites work: The strong chromatic index of Halin graphs
cites work: Strong edge-coloring of pseudo-Halin graphs
cites work: On the strong chromatic index of cubic Halin graphs
cites work: On the computational complexity of strong edge coloring
cites work: A bound on the strong chromatic index of a graph
cites work: A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
cites work: Q3423984
cites work: The strong chromatic index of complete cubic Halin graphs
cites work: Strong edge chromatic index of the generalized Petersen graphs
DOI: 10.1016/J.DAM.2021.06.016
Recommended article: The strong chromatic index of Halin graphs
Recommended article: Q3423984
Recommended article: Upper bounds for the strong chromatic index of Halin graphs
Recommended article: On the strong chromatic index of cubic Halin graphs
Recommended article: The strong chromatic index of complete cubic Halin graphs
Recommended article: Q5752590
Recommended article: A bound on the strong chromatic index of a graph
Recommended article: Q5490517
Recommended article: The strong chromatic index of a class of graphs
Recommended article: Strong Chromatic Index of Chordless Graphs
description: scientific article; zbMATH DE number 7377182