On the strong chromatic index of cyclic multigraphs

DOI10.1016/S0166-218X(99)00123-7zbMath0957.05038WikidataQ127349699 ScholiaQ127349699MaRDI QIDQ1962032

Mariusz Meszka, Pavol Gvozdjak, Zdzisław Skupień, Peter Horák

Publication date: 30 January 2000

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

zbMATH Keywords

multigraphinduced matchingstrong chromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

BCH codes and distance multi- or fractional colorings in hypercubes asymptotically

Cites Work

• Induced matchings in bipartite graphs
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• Induced matchings in cubic graphs
• Some maximum multigraphs and adge/vertex distance colourings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the strong chromatic index of cyclic multigraphs