Characterizing forbidden pairs for relative length of longest paths and cycles (Q2138962): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2022.112870 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Relative lengths of paths and cycles in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure and stable Hamiltonian properties in claw-free graphs / 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: Forbidden pairs and the existence of a dominating cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cycles and forbidden pairs containing \(P_5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative length of long paths and cycles in graphs with large degree sums / 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: A pair of forbidden subgraphs and perfect matchings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative lengths of paths and cycles in k-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relative length of longest paths and cycles / 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: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2022.112870 / rank
 
Normal rank

Latest revision as of 05:17, 17 December 2024

scientific article
Language Label Description Also known as
English
Characterizing forbidden pairs for relative length of longest paths and cycles
scientific article

    Statements

    Characterizing forbidden pairs for relative length of longest paths and cycles (English)
    0 references
    0 references
    0 references
    17 May 2022
    0 references
    forbidden subgraph
    0 references
    forbidden pair
    0 references
    relative length
    0 references
    circumference
    0 references

    Identifiers