Degree and neighborhood conditions for Hamiltonicity of claw-free graphs (Q2404404): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Zhi-Hong Chen / rank
Normal rank
 
Property / author
 
Property / author: Zhi-Hong Chen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2740458581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian properties of graphs with large neighborhood unions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction method to find spanning Eulerian subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs without spanning closed trails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5740779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized degree conditions for graphs with bounded independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique covering and degree conditions for Hamiltonicity in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity and minimum degree in 3-connected claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum / 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: A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity in 3-connected claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in 2‐connected claw‐free‐graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian claw-free graphs involving minimum degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest paths and cycles in K1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / 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 dominating and spanning circuits in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in claw-free graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:40, 14 July 2024

scientific article
Language Label Description Also known as
English
Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
scientific article

    Statements

    Degree and neighborhood conditions for Hamiltonicity of claw-free graphs (English)
    0 references
    18 September 2017
    0 references
    claw-free graph
    0 references
    Hamiltonicity
    0 references
    neighborhood condition
    0 references
    degree condition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers