Cycles intersecting a prescribed vertex set
From MaRDI portal
Publication:3984472
DOI10.1002/JGT.3190150609zbMATH Open0754.05047OpenAlexW2024581385MaRDI QIDQ3984472FDOQ3984472
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
Recommendations
Cited In (8)
- Circuits through prescribed vertices in k‐connected k‐regular graphs
- A note on traversing specified vertices in graphs embedded with large representativity
- A look at cycles containing specified elements of a graph
- Title not available (Why is that?)
- A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs
- One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
- Cycles containing all the odd-degree vertices
- Cycles through a prescribed vertex set in \(n\)-connected graphs.
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)