scientific article; zbMATH DE number 16299

MaRDI QIDQ3972952zbMATH OpenFDO

Authors Michael V. Lomonosov

Publication date 26 June 1992

zbMATH Keywords

3-connected graphs\(A\)-Cycle ProblemHamilton cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• On cycles through prescribed vertices in weakly separable graphs
• scientific article; zbMATH DE number 3929042
• Cycles with prescribed and forbidden sets of elements in cubic graphs
• Cycles through ten vertices in 3-connected cubic graphs
• On short cycles through prescribed vertices of a graph

Cited in

(7)

• On circuits through five edges
• Toughness and edge-toughness
• One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
• Rooted topological minors on four vertices
• Local topological toughness and local factors
• On cycles through specified vertices
• An Improved Algorithm for Finding Cycles Through Elements

This page was built for publication:

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