On the strong chromatic index of cyclic multigraphs

DOI10.1016/S0166-218X(99)00123-7zbMATH Open0957.05038WikidataQ127349699 ScholiaQ127349699MaRDI QIDQ1962032FDOQ1962032

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

Publication date: 30 January 2000

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

Recommendations

• scientific article; zbMATH DE number 1501957
• Strong chromatic index of subcubic planar multigraphs
• scientific article; zbMATH DE number 4187830
• The strong chromatic index of graphs and subdivisions
• Publication:3201075

zbMATH Keywords

multigraphinduced matchingstrong chromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some maximum multigraphs and adge/vertex distance colourings
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
• Title not available (Why is that?)
• Chromatic Edge Strength of Some Multigraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962032)