Independent dominating sets and a second hamiltonian cycle in regular graphs
From MaRDI portal
Publication:1386422
DOI10.1006/jctb.1997.1794zbMath0895.05038OpenAlexW2007351870MaRDI QIDQ1386422
Publication date: 6 September 1998
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1997.1794
Related Items (19)
Cycles with a chord in dense graphs ⋮ Regular Graphs with Few Longest Cycles ⋮ Hamiltonicity in locally finite graphs: two extensions and a counterexample ⋮ Hamilton cycles in infinite cubic graphs ⋮ A degree constraint for uniquely Hamiltonian graphs ⋮ On Sheehan's Conjecture for Graphs with Symmetry ⋮ Dual power assignment via second Hamiltonian cycle ⋮ Cycles of many lengths in Hamiltonian graphs ⋮ 2-factor Hamiltonian graphs. ⋮ 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles ⋮ Long cycles in Hamiltonian graphs ⋮ Chords in longest cycles ⋮ Graphs with few hamiltonian cycles ⋮ Vertices of small degree in uniquely Hamiltonian graphs ⋮ Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles ⋮ On uniquely Hamiltonian claw-free and triangle-free graphs ⋮ From one to many rainbow Hamiltonian cycles ⋮ On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles ⋮ Uniquely Hamiltonian Graphs of Minimum Degree 4
Cites Work
- On edge-Hamiltonian property of Cayley graphs
- A solution to a colouring problem of P. Erdős
- Spanning cycles of nearly cubic graphs
- Chords of longest cycles in cubic graphs
- On the Number of Hamiltonian Cycles in Bipartite Graphs
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
- On Hamiltonian Circuits
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Independent dominating sets and a second hamiltonian cycle in regular graphs
