Strong edge-coloring for cubic Halin graphs
type: Item
instance of: scholarly article
title: Strong edge-coloring for cubic Halin graphs
zbMATH Open document ID: 1237.05069
author: Gerard Jennhwa Chang
author: Daphne Der-Fen Liu
published in: Discrete Mathematics
publication date: 2012-03-29T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6019371
zbMATH Keywords: strong edge-coloring
zbMATH Keywords: strong chromatic index
zbMATH Keywords: Halin graphs
zbMATH Keywords: cubic graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2012.01.014
OpenAlex ID: W1966127312
cites work: The strong chromatic index of a cubic graph is at most 10
cites work: Incidence and strong edge colorings of graphs
cites work: Induced matchings
cites work: Strong edge-coloring of graphs with maximum degree 4 using 22 colors
cites work: Problems and results in combinatorial analysis and graph theory
cites work: Q5752590
cites work: Q3320410
cites work: Q3216671
cites work: New results on induced matchings
cites work: Q3201075
cites work: Induced matchings in cubic graphs
cites work: On the computational complexity of strong edge coloring
cites work: The incidence coloring conjecture for graphs of maximum degree 3
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: The strong chromatic index of a class of graphs
DOI: 10.1016/J.DISC.2012.01.014
description: scientific article; zbMATH DE number 6019371