Forbidden subgraphs and the existence of a 2-walk (Q400402): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness, trees, and walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden induced subgraphs for star-free 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: 2-walks in circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Induced Subgraphs for Toughness / rank
 
Normal rank

Latest revision as of 21:57, 8 July 2024

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

    Statements

    Forbidden subgraphs and the existence of a 2-walk (English)
    0 references
    0 references
    21 August 2014
    0 references
    \(k\)-walk
    0 references
    2-walk
    0 references
    forbidden subgraph
    0 references
    toughness
    0 references

    Identifiers