Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs (Q345079): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Zhi-Hong Chen / rank
Normal rank
 
Property / author
 
Property / author: Limning Xiong / rank
Normal rank
 
Property / author
 
Property / author: Zhi-Hong Chen / rank
 
Normal rank
Property / author
 
Property / author: Limning Xiong / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6656163 / rank
 
Normal rank
Property / zbMATH Keywords
 
claw-free graph
Property / zbMATH Keywords: claw-free graph / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamiltonian cycle
Property / zbMATH Keywords: Hamiltonian cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum degree condition
Property / zbMATH Keywords: minimum degree condition / rank
 
Normal rank
Property / zbMATH Keywords
 
Ryjáček's closure concept
Property / zbMATH Keywords: Ryjáček's closure concept / rank
 
Normal rank
Property / zbMATH Keywords
 
Catlin's reduction method
Property / zbMATH Keywords: Catlin's reduction method / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2016.05.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2413683251 / 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: Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / 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: Recent advances on the Hamiltonian problem: survey III / 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 3‐connected claw‐free graphs / 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: Hamiltonian cycles in 3-connected claw-free graphs / 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: On a closure concept in claw-free graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 23:38, 12 July 2024

scientific article
Language Label Description Also known as
English
Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
scientific article

    Statements

    Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 November 2016
    0 references
    claw-free graph
    0 references
    Hamiltonian cycle
    0 references
    minimum degree condition
    0 references
    Ryjáček's closure concept
    0 references
    Catlin's reduction method
    0 references

    Identifiers