Forbidden subgraphs and the existence of a 2-factor (Q3055922): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4393234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs that imply 2-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing forbidden pairs for hamiltonian properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden triples implying Hamiltonicity: for all graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential forbidden triples implying hamiltonicity: for sufficiently large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing forbidden clawless triples implying Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pair of forbidden subgraphs and perfect matchings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs and bounds on the size of a maximum matching / rank
 
Normal rank

Latest revision as of 11:38, 3 July 2024

scientific article
Language Label Description Also known as
English
Forbidden subgraphs and the existence of a 2-factor
scientific article

    Statements