Existence of Dlambda-cycles and Dlambda-paths

DOI10.1016/0012-365X(83)90196-6zbMATH Open0521.05042MaRDI QIDQ1055432FDOQ1055432

Henk Jan Veldman

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cycleHamiltonian pathD(lambda)-cycleD(lambda)-path

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• A note on Hamiltonian circuits
• Title not available (Why is that?)
• Existence of dominating cycles and paths
• Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
• Title not available (Why is that?)

Cited In (16)

• On the dominating (induced) cycles of iterated line graphs
• A generalization of Ore's Theorem involving neighborhood unions
• Extensions and consequences of Chvátal-Erdös' theorem
• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
• \(D_ \lambda\)-cycles in 3-cyclable graphs
• On the bipartite independence number of a balanced bipartite graph
• Relative length of longest paths and longest cycles in triangle-free graphs
• A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs
• An Ore-type condition for hamiltonicity in tough graphs and the extremal examples
• Longest cycles in triangle-free graphs
• A proof of a conjecture about \(D_ \lambda\)-paths in graphs with large neighborhood unions
• \(D_ \lambda\)-cycles in \(\lambda\)-claw-free graphs
• An Ore-type condition for Hamiltonicity in tough graphs
• Hamiltonian properties of graphs with large neighborhood unions
• Long cycles in graphs with prescribed toughness and minimum degree
• Edge degrees and dominating cycles

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)