Chordality and 2-factors in tough graphs (Q1962052): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Not every 2-tough graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness, minimum degree, and the existence of 2‐factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reguläre Faktoren von Graphen. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4378526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and the existence ofk-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness, hamiltonicity and split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factors of Graphs / rank
 
Normal rank

Latest revision as of 12:29, 29 May 2024

scientific article
Language Label Description Also known as
English
Chordality and 2-factors in tough graphs
scientific article

    Statements

    Chordality and 2-factors in tough graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 January 2000
    0 references
    0 references
    chordal graphs
    0 references