Forbidden subgraphs for Hamiltonicity of 1-tough graphs (Q339484): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Long cycles in graphs with prescribed toughness and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness in graphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not every 2-tough graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some intriguing problems in Hamiltonian graph theory---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Toughness and Hamiltonicity of 2<i>K</i><sub>2</sub>‐Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing forbidden pairs for hamiltonian properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of posets and the corresponding comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disconnected forbidden subgraphs, toughness and Hamilton cycles / rank
 
Normal rank

Latest revision as of 22:00, 12 July 2024

scientific article
Language Label Description Also known as
English
Forbidden subgraphs for Hamiltonicity of 1-tough graphs
scientific article

    Statements

    Identifiers