Closure and forbidden pairs for 2-factors (Q968435): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Characterizations of derived graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening the closure concept in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs, hamiltonicity and closure in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918148 / 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: Sufficient conditions for a graph to be Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs and Hamiltonian properties and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a closure concept in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure and forbidden pairs for Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure concept for 2-factors in claw-free graphs / rank
 
Normal rank

Revision as of 18:48, 2 July 2024

scientific article
Language Label Description Also known as
English
Closure and forbidden pairs for 2-factors
scientific article

    Statements

    Identifiers