Extending cycles locally to Hamilton cycles (Q278887): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4894622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian edge sets in locally finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On end degrees and infinite cycles in locally finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Cycles in Planar Locally Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton circles in infinite planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally finite graphs with ends: a topological approach. III. Fundamental group and homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretical versus topological ends of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On infinite cycles. I, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological paths, cycles and spanning trees in infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Enden topologischer Räume und Gruppen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Hamilton cycles in squares of locally finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Menger's theorem for infinite locally finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for Hamiltonicity in locally finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spanning tree packings of highly edge connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the line graph of the square and the square of the line graph of a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every connected, locally connected nontrivial graph with no induced claw is hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal infinite graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Paths in Squares of Infinite Locally Finite Blocks / rank
 
Normal rank

Latest revision as of 22:36, 11 July 2024

scientific article
Language Label Description Also known as
English
Extending cycles locally to Hamilton cycles
scientific article

    Statements

    Extending cycles locally to Hamilton cycles (English)
    0 references
    0 references
    0 references
    0 references
    3 May 2016
    0 references
    Summary: A Hamilton circle in an infinite graph is a homeomorphic copy of the~ unit circle \(S^1\) that contains all vertices and all ends precisely once. We prove that every connected, locally connected, locally finite, claw-free graph has such a Hamilton circle, extending a result of \textit{D. J. Oberly} and \textit{D. P. Sumner} [J. Graph Theory 3, 351--356 (1979; Zbl 0424.05036)] to infinite graphs. Furthermore, we show that such graphs are Hamilton-connected if and only if they are \(3\)-connected, extending a result of \textit{A. S. Asratian} [J. Graph Theory 23, No. 2, 191--201 (1996; Zbl 0858.05067)]. \textit{Hamilton-connected} means that between any two vertices there is a Hamilton arc, a homeomorphic copy of the unit interval \([0,1]\) that contains all vertices and all ends precisely once.
    0 references
    0 references
    graph theory
    0 references
    Hamilton cycles
    0 references
    infinite graphs
    0 references
    0 references
    0 references
    0 references