Cycles intersecting a prescribed vertex set

DOI10.1002/JGT.3190150609MaRDI QIDQ3984472zbMATH OpenOpenAlexFDO

Authors Atsushi Kaneko, Akira Saito

Publication date 27 June 1992

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190150609

zbMATH Keywords

cyclesprescribed vertex set

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Cycles through a prescribed vertex set in \(n\)-connected graphs.
• scientific article; zbMATH DE number 3853109
• Circuits through prescribed vertices in k‐connected k‐regular graphs
• Cycles and paths through specified vertices in k-connected graphs

Cited in

(8)

• A look at cycles containing specified elements of a graph
• Cycles through a prescribed vertex set in \(n\)-connected graphs.
• One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
• A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs
• Cycles containing all the odd-degree vertices
• scientific article; zbMATH DE number 3853109 (Why is no real title available?)
• Circuits through prescribed vertices in k‐connected k‐regular graphs
• A note on traversing specified vertices in graphs embedded with large representativity

This page was built for publication: Cycles intersecting a prescribed vertex set

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