Toughness, forbidden subgraphs and pancyclicity (Q2045380): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-021-02284-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3132832720 / 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: Not every 2-tough graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness in graphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4041607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967194 / 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: Extending cycles in graphs / 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: Toughness, hamiltonicity and split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs for Hamiltonicity of 1-tough 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
Property / cites work
 
Property / cites work: Structural properties and hamiltonicity of neighborhood graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2804770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2823211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the perfect Roman domination number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness, forbidden subgraphs, and Hamilton-connected graphs / rank
 
Normal rank

Latest revision as of 10:16, 26 July 2024

scientific article
Language Label Description Also known as
English
Toughness, forbidden subgraphs and pancyclicity
scientific article

    Statements

    Toughness, forbidden subgraphs and pancyclicity (English)
    0 references
    0 references
    0 references
    0 references
    12 August 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    toughness
    0 references
    forbidden subgraph
    0 references
    pancyclic graph
    0 references
    Hamiltonian graph
    0 references
    0 references