Maximum Δ-edge-colorable subgraphs of class II graphs (Q2911495): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parsimonious edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic index of multigraphs without large triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On disjoint matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the maximum 3-edge-colorable subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification and characterizations of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refinement of Vizing's theorem / rank
 
Normal rank

Latest revision as of 14:43, 5 July 2024

scientific article
Language Label Description Also known as
English
Maximum Δ-edge-colorable subgraphs of class II graphs
scientific article

    Statements

    Maximum Δ-edge-colorable subgraphs of class II graphs (English)
    0 references
    0 references
    0 references
    31 August 2012
    0 references
    maximum \(\Delta \)-edge-colorable subgraph
    0 references
    matching
    0 references
    2-factor
    0 references
    edge-chromatic number
    0 references
    chromatic index
    0 references
    class II graph
    0 references

    Identifiers

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