scientific article; zbMATH DE number 4195987

MaRDI QIDQ5203047zbMATH OpenFDO

Authors Odile Marcotte

Publication date 1990

zbMATH Keywords

multigraphgraph minormaximum degreechromatic index

Mathematics Subject Classification ID

Integer programming (90C10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the chromatic index of multigraphs and a conjecture of Seymour (I)
• Optimal edge-colourings for a class of planar multigraphs
• scientific article; zbMATH DE number 4122017
• scientific article; zbMATH DE number 4195986
• The chromatic index of multigraphs that are nearly full

Cited in

(14)

• On the chromatic index of graphs with \(2m+1\) vertices and \(2m^2\) edges.
• On multiples of simple graphs and Vizing's theorem
• On Gupta’s Codensity Conjecture
• On a limit of the method of Tashkinov trees for edge-colouring
• Edge coloring multigraphs without small dense subsets
• On the fractional chromatic index of a graph and its complement
• scientific article; zbMATH DE number 2188427 (Why is no real title available?)
• Proof of McDiarmid-Reed conjecture for a subclass of hexagonal graphs
• Approximating the chromatic index of multigraphs
• scientific article; zbMATH DE number 3970777 (Why is no real title available?)
• On the chromatic index of multigraphs and a conjecture of Seymour (I)
• Fractional and integral colourings
• Optimal edge-colourings for a class of planar multigraphs
• Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\)

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 Q5203047)