Cycles and paths through specified vertices

MaRDI QIDQ2719964zbMATH OpenFDO

Authors Sujuan Zheng

Publication date 20 May 2002

Published in Journal of Nanjing Normal University. Natural Science Edition (Search for Journal in Brave)

zbMATH Keywords

cycleindependent setpathHamiltonian graph

Mathematics Subject Classification ID

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

Recommendations

• Cycles through prescribed vertices with large degree sum
• scientific article; zbMATH DE number 5371443
• Cycles and paths through specified vertices in k-connected graphs
• Long paths and cycles through specified vertices in k-connected graphs.
• Long cycles through specified vertices

Cited in

(14)

• Broadcasts on paths and cycles
• Cycles and paths through specified vertices in k-connected graphs
• Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs
• An existence criterion for a cycle such that the vertices not included in it are independent
• Cycles through prescribed vertices with large degree sum
• A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs
• Graph of \(uv\)-paths in connected graphs
• Cycles through given vertices and closures
• Cycles through k+2 vertices in k-connected graphs
• scientific article; zbMATH DE number 2081148 (Why is no real title available?)
• Long paths and cycles through specified vertices in k-connected graphs.
• Long cycles through specified vertices
• Cycles through a prescribed vertex set in \(n\)-connected graphs.
• Eulerian subgraphs containing given vertices

This page was built for publication: Cycles and paths through specified vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2719964)