Hamiltonicity in locally finite graphs: two extensions and a counterexample
From MaRDI portal
Publication:1658750
zbMath1393.05191arXiv1701.06029MaRDI QIDQ1658750
Publication date: 15 August 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.06029
Related Items (3)
Hamilton cycles in infinite cubic graphs ⋮ Cycles through all finite vertex sets in infinite graphs ⋮ Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs
- Extending cycles locally to Hamilton cycles
- On spanning tree packings of highly edge connected graphs
- A sufficient condition for Hamiltonicity in locally finite graphs
- Contractible edges in 2-connected locally finite graphs
- On infinite cycles. I, II
- Characterizations of outerplanar graphs
- Independent dominating sets and a second hamiltonian cycle in regular graphs
- Graph-theoretical versus topological ends of graphs.
- Hamilton cycles in infinite cubic graphs
- Topological paths, cycles and spanning trees in infinite graphs
- On end degrees and infinite cycles in locally finite graphs
- MacLane's planarity criterion for locally finite graphs
- Infinite Hamilton cycles in squares of locally finite graphs
- The square of every two-connected graph is Hamiltonian
- On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
- 3-connected planar spaces uniquely embed in the sphere
- Independent dominating sets and hamiltonian cycles
- Hamilton Cycles in Planar Locally Finite Graphs
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- On the Cube of a Graph
- Trees with Hamiltonian square
- On Hamiltonian Circuits
This page was built for publication: Hamiltonicity in locally finite graphs: two extensions and a counterexample
