Existence of Dlambda-cycles and Dlambda-paths
From MaRDI portal
Cites work
Cited in
(16)- Longest cycles in triangle-free graphs
- Hamiltonian properties of graphs with large neighborhood unions
- On the bipartite independence number of a balanced bipartite graph
- A generalization of Ore's Theorem involving neighborhood unions
- A proof of a conjecture about \(D_ \lambda\)-paths in graphs with large neighborhood unions
- \(D_ \lambda\)-cycles in \(\lambda\)-claw-free graphs
- Long cycles in graphs with prescribed toughness and minimum degree
- \(D_ \lambda\)-cycles in 3-cyclable graphs
- Extensions and consequences of Chvátal-Erdös' theorem
- An Ore-type condition for Hamiltonicity in tough graphs
- On the dominating (induced) cycles of iterated line graphs
- A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
- Edge degrees and dominating cycles
- Relative length of longest paths and longest cycles in triangle-free graphs
- An Ore-type condition for hamiltonicity in tough graphs and the extremal examples
This page was built for publication: Existence of Dlambda-cycles and Dlambda-paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1055432)