Pages that link to "Item:Q3427374"
From MaRDI portal
The following pages link to Independent dominating sets and hamiltonian cycles (Q3427374):
Displaying 22 items.
- Domination versus independent domination in cubic graphs (Q385388) (← links)
- Chords in longest cycles (Q684125) (← links)
- A degree constraint for uniquely Hamiltonian graphs (Q882780) (← links)
- Independent dominating sets and a second hamiltonian cycle in regular graphs (Q1386422) (← links)
- Vertices of small degree in uniquely Hamiltonian graphs (Q1569030) (← links)
- Hamiltonicity in locally finite graphs: two extensions and a counterexample (Q1658750) (← links)
- Dual power assignment via second Hamiltonian cycle (Q1686228) (← links)
- Long cycles in Hamiltonian graphs (Q1717607) (← links)
- From one to many rainbow Hamiltonian cycles (Q2102759) (← links)
- On uniquely Hamiltonian claw-free and triangle-free graphs (Q2344006) (← links)
- Uniquely Hamiltonian graphs of minimum degree 4 (Q2874097) (← links)
- On Sheehan's Conjecture for Graphs with Symmetry (Q2947858) (← links)
- Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs (Q4304250) (← links)
- On the Minimum Number of Hamiltonian Cycles in Regular Graphs (Q4646702) (← links)
- 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles (Q5026982) (← links)
- The independent domination numbers of strong product of two cycles (Q5031932) (← links)
- Regular Graphs with Few Longest Cycles (Q5067426) (← links)
- Graphs with few hamiltonian cycles (Q5207451) (← links)
- Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs (Q6585253) (← links)
- Few Hamiltonian cycles in graphs with one or two vertex degrees (Q6590640) (← links)
- Approximate and randomized algorithms for computing a second Hamiltonian cycle (Q6614106) (← links)
- On vertex-transitive graphs with a unique Hamiltonian cycle (Q6642516) (← links)
