A comprehensive analysis of degree based condition for Hamiltonian cycles (Q1041248): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2009.09.018 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008066793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian cycles and Hamiltonian paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved degree based condition for Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new sufficient condition for hamiltonicity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient condition for a graph to be Hamiltonian / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2009.09.018 / rank
 
Normal rank

Latest revision as of 15:30, 10 December 2024

scientific article
Language Label Description Also known as
English
A comprehensive analysis of degree based condition for Hamiltonian cycles
scientific article

    Statements

    A comprehensive analysis of degree based condition for Hamiltonian cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 December 2009
    0 references
    Hamiltonian cycle
    0 references
    Hamiltonian path
    0 references
    graphs
    0 references

    Identifiers