Forbidden pairs and the existence of a dominating cycle (Q2515588): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1805866081 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1502.02159 / 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: How many conjectures can you stand? A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211339 / 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: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs / 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: Q3838206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-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: Advances on the Hamiltonian problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs and Hamiltonian properties and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every 3‐connected claw‐free <i>Z</i> <sub>8</sub> ‐free graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity and forbidden subgraphs in 4‐connected graphs / 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 / cites work
 
Property / cites work: Claw-free 3-connectedP11-free graphs are hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree sum condition for longest cycles in 3-connected graphs / rank
 
Normal rank

Latest revision as of 14:45, 10 July 2024

scientific article
Language Label Description Also known as
English
Forbidden pairs and the existence of a dominating cycle
scientific article

    Statements

    Forbidden pairs and the existence of a dominating cycle (English)
    0 references
    0 references
    0 references
    0 references
    5 August 2015
    0 references
    Hamilton cycles
    0 references
    dominating cycles
    0 references
    forbidden pairs
    0 references

    Identifiers