Pages that link to "Item:Q1123212"
From MaRDI portal
The following pages link to Neighbourhood unions and Hamiltonian properties in graphs (Q1123212):
Displayed 36 items.
- Neighborhood unions for the existence of disjoint chorded cycles in graphs (Q367086) (← links)
- Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs (Q489317) (← links)
- Computation of the 0-dual closure for hamiltonian graphs (Q686512) (← links)
- No-hole \((r+1)\)-distant colorings (Q688267) (← links)
- Four sufficient conditions for hamiltonian graphs (Q803156) (← links)
- On a neighborhood condition implying the existence of disjoint complete graphs (Q911615) (← links)
- Hamiltonian-connected graphs (Q945175) (← links)
- Hamiltonism, degree sum and neighborhood intersections (Q1175978) (← links)
- Hamiltonian properties of graphs with large neighborhood unions (Q1182981) (← links)
- On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs (Q1196745) (← links)
- Neighborhood unions and a generalization of Dirac's theorem (Q1199474) (← links)
- Neighborhood unions and factor critical graphs (Q1301846) (← links)
- Hamiltonian paths and hamiltonian connectivity in graphs (Q1309475) (← links)
- A generalization of Ore's Theorem involving neighborhood unions (Q1313847) (← links)
- Extremal problems and generalized degrees (Q1322223) (← links)
- Extending matchings in graphs: A survey (Q1322235) (← links)
- Neighborhood unions and Hamiltonian properties (Q1336717) (← links)
- A proof of a conjecture about \(D_ \lambda\)-paths in graphs with large neighborhood unions (Q1356422) (← links)
- Minimum independent generalized \(t\)-degree and independence number in \(K_{1,r+1}\)-free graphs (Q1356749) (← links)
- Neighborhood conditions for balanced independent sets in bipartite graphs (Q1381845) (← links)
- Leaf number and Hamiltonian \(C_4\)-free graphs (Q1693960) (← links)
- One sufficient condition for Hamiltonian graphs involving distances (Q1759263) (← links)
- A generalization of Dirac's theorem for \(K(1,3)\)-free graphs (Q1813059) (← links)
- Neighborhood unions and cyclability of graphs (Q1827838) (← links)
- Neighborhood unions and hamiltonicity of graphs (Q1894772) (← links)
- A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs (Q1896341) (← links)
- Two new sufficient conditions for Hamilton-connected graphs (Q1898892) (← links)
- Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle (Q2400580) (← links)
- Neighborhood unions and extremal spanning trees (Q2427493) (← links)
- Neighborhood unions and \(Z_3\)-connectivity in graphs (Q2637734) (← links)
- The neighborhood union of independent sets and hamiltonicity of graphs (Q2643317) (← links)
- My Friend and Colleague, Richard Schelp (Q2883849) (← links)
- On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity (Q3120260) (← links)
- A neigborhood union condition for nonadjacent vertices in graphs (Q4595248) (← links)
- (Q4852568) (← links)
- 2-Trees: Structural insights and the study of Hamiltonian paths (Q6132868) (← links)