Hamilton circuits and essential girth of claw free graphs (Q5964993): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On a closure concept in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factors of 4-connected claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonicity of generalized net-free graphs of large diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced nets and Hamiltonicity of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing forbidden pairs for hamiltonian properties / 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: Forbidden subgraphs and Hamiltonian properties and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Eulerian and Hamiltonian Graphs and Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hourglasses and Hamilton cycles in 4‐connected claw‐free 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: Hamiltonicity and forbidden subgraphs in 4‐connected graphs / rank
 
Normal rank

Revision as of 12:11, 11 July 2024

scientific article; zbMATH DE number 6548091
Language Label Description Also known as
English
Hamilton circuits and essential girth of claw free graphs
scientific article; zbMATH DE number 6548091

    Statements

    Hamilton circuits and essential girth of claw free graphs (English)
    0 references
    0 references
    0 references
    0 references
    2 March 2016
    0 references
    claw-free graph
    0 references
    net-free graph
    0 references
    Hamilton circuit
    0 references
    forbidden pairs
    0 references
    essential girth
    0 references
    closure operation
    0 references

    Identifiers