The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \) (Q1926022): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An extension of Vizing's adjacency lemma of edge chromatic critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On characterizing Vizing's edge colouring bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Vizing's bound for the chromatic index of a multigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Coloring the Lines of a Network / rank
 
Normal rank

Latest revision as of 00:08, 6 July 2024

scientific article
Language Label Description Also known as
English
The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \)
scientific article

    Statements

    The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \) (English)
    0 references
    0 references
    0 references
    27 December 2012
    0 references
    chromatic index
    0 references
    maximum degree
    0 references
    maximum multiplicity
    0 references
    Vizing's bound
    0 references
    Shannon's bound
    0 references

    Identifiers