scientific article; zbMATH DE number 227551

zbMATH Open0780.05025MaRDI QIDQ5286938FDOQ5286938

Authors: Michael J. Plantholt 

Publication date: 12 January 1994

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3918395
• Publication:4863469
• A note concerning the chromatic index of multigraphs
• The chromatic index of multigraphs that are nearly full

zbMATH Keywords

multigraphdecompositionupper boundchromatic index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (9)

• A combined logarithmic bound on the chromatic index of multigraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the upper chromatic index of a multigraph
• Optimal edge-coloring with edge rate constraints
• The chromatic index of multigraphs of order at most 10
• Improved bounds for the chromatic index of graphs and multigraphs
• A sublinear bound on the chromatic index of multigraphs
• Title not available (Why is that?)

This page was built for publication:

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