scientific article; zbMATH DE number 227551

MaRDI QIDQ5286938zbMATH OpenFDO

Authors Michael J. Plantholt

Publication date 12 January 1994

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)

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

Cited in

(9)

• Optimal edge-coloring with edge rate constraints
• Improved bounds for the chromatic index of graphs and multigraphs
• A sublinear bound on the chromatic index of multigraphs
• The chromatic index of multigraphs of order at most 10
• On the upper chromatic index of a multigraph
• A combined logarithmic bound on the chromatic index of multigraphs
• scientific article; zbMATH DE number 3977025 (Why is no real title available?)
• scientific article; zbMATH DE number 4061274 (Why is no real title available?)
• scientific article; zbMATH DE number 841623 (Why is no real title available?)

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)