Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs (Q1959719): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Quasi-claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3201099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global insertion and Hamiltonicity in DCT-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / 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: Toughness and hamiltonicity in almost claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hamiltonicity of \(P_{3}\)-dominated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor-criticality and matching extension in DCT-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost claw‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Factors and Antifactor Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank

Latest revision as of 07:54, 3 July 2024

scientific article
Language Label Description Also known as
English
Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs
scientific article

    Statements

    Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs (English)
    0 references
    0 references
    0 references
    7 October 2010
    0 references
    0 references
    \({\mathcal{P}_3}\)-dominated graphs
    0 references
    1-tough graph
    0 references
    perfect matching
    0 references
    factor-criticality
    0 references
    \(p\)-extendable graph
    0 references
    0 references