On the strong chromatic index of cyclic multigraphs
type: Item
instance of: scholarly article
title: On the strong chromatic index of cyclic multigraphs
zbMATH Open document ID: 0957.05038
DOI: 10.1016/S0166-218X(99)00123-7
author: Pavol Gvozdjak
author: Mariusz Meszka
author: Zdzisław Skupień
author: Peter Horák
published in: Discrete Applied Mathematics
publication date: 2000-01-30T00:00:00Z
review text: The strong chromatic index \(\text{sq}(G)\) of a multigraph \(G\) is the smallest number of colours needed to colour the edges of \(G\) so that each colour class is an induced matching. The largest size of a submultigraph of \(G\) without any induced matching of size two is denoted by \(\eta(G)\). A cyclic multigraph is a multigraph whose underlying graph is a cycle. Results providing exact values or upper bounds for \(\text{sq}(G)\) where \(G\) is a cycling multigraphs are shown. The often involve the parameter \(\eta(G)\).
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1395002
zbMATH Keywords: strong chromatic index
zbMATH Keywords: multigraph
zbMATH Keywords: induced matching
reviewed by: Raffaele Scapellato
MaRDI profile type: Publication
cites work: The strong chromatic index of a cubic graph is at most 10
cites work: Q5668821
cites work: Problems and results in combinatorial analysis and graph theory
cites work: Induced matchings in bipartite graphs
cites work: Q5752590
cites work: Q3320410
cites work: Q3216671
cites work: Induced matchings in cubic graphs
cites work: Q5589872
cites work: Q5552096
cites work: Some maximum multigraphs and adge/vertex distance colourings
Wikidata QID: Q127349699
description: scientific article; zbMATH DE number 1395002