The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree (Q5866456): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the average degree of edge chromatic critical graphs. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement to the Hilton-Zhao vertex-splitting conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the 1-factorization and Hamilton Decomposition Conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets and 2‐factors in edge‐chromatic‐critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overfull conjecture for graphs with high minimum degree / 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: Q3118960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558480 / rank
 
Normal rank

Revision as of 04:04, 30 July 2024

scientific article; zbMATH DE number 7589623
Language Label Description Also known as
English
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree
scientific article; zbMATH DE number 7589623

    Statements

    The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 September 2022
    0 references
    overfull conjecture
    0 references
    overfull graph
    0 references
    multifan
    0 references
    Kierstead path
    0 references

    Identifiers

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