Optimal edge-colourings for a class of planar multigraphs (Q5955208)

From MaRDI portal
Revision as of 01:34, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article; zbMATH DE number 1703966
Language Label Description Also known as
English
Optimal edge-colourings for a class of planar multigraphs
scientific article; zbMATH DE number 1703966

    Statements

    Optimal edge-colourings for a class of planar multigraphs (English)
    0 references
    0 references
    13 February 2002
    0 references
    The author determines the chromatic index of multigraphs containing no minors isomorphic either to \(K_{3,3}\) or \({K_5}-e\) (this latter means \(K_5\) without one of its edges). The answer (the maximum of the maximum valency and a function on the odd subset of the vertices) partially verifies a conjecture of \textit{P. D. Seymour} [J. Comb. Theory, Ser. B 31, 82--94 (1981; Zbl 0471.05031)] and is a generalization of a result of \textit{P. D. Seymour} [Combinatorica 10, No. 4, 379--392 (1990; Zbl 0721.05023)] for series-parallel graphs.
    0 references
    optimal edge-colorings
    0 references
    planar multigraphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references