Cycles and paths through specified vertices in k-connected graphs
From MaRDI portal
Let G be a k-connected graph with minimum degree d and at least 2d vertices. Then G has a cycle of length at least 2d through any specified set of k vertices. A similar result for paths is also given.
Recommendations
- Long paths and cycles through specified vertices in k-connected graphs.
- Cycles passing throughk + 1 vertices ink-connected graphs
- Long cycles passing through \(\lfloor\frac{4k+1}3\rfloor\) vertices in \(k\)-connected graphs
- Cycles and paths through specified vertices
- scientific article; zbMATH DE number 1286512
Cites work
- A generalization of Dirac's theorem
- Applications of Menger's graph theorem
- Cycles through three vertices in 2-connected graphs
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Long cycles through specified vertices in a graph
- Relative lengths of paths and cycles in k-connected graphs
- Some Theorems on Abstract Graphs
Cited in
(37)- A look at cycles containing specified elements of a graph
- Weighted degrees and heavy cycles in weighted graphs
- Cycles through three vertices in 2-connected graphs
- Long cycles through specified vertices in a graph
- Cycles through a prescribed vertex set in \(n\)-connected graphs.
- Long cycles through a linear forest
- On short cycles through prescribed vertices of a graph
- Long cycles passing through a linear forest
- Disjoint long cycles in a graph
- Recent advances on the Hamiltonian problem: survey III
- Relative length of longest paths and longest cycles in triangle-free graphs
- Existence of two disjoint long cycles in graphs
- Long cycles through specified vertices
- Long paths and cycles through specified vertices in k-connected graphs.
- Cycles and paths through specified vertices
- Claw-free graphs and 2-factors that separate independent vertices
- k-path-connectivity and mk-generation: an upper bound on m
- Cycles passing throughk + 1 vertices ink-connected graphs
- Updating the hamiltonian problem—A survey
- Cycles intersecting a prescribed vertex set
- scientific article; zbMATH DE number 1286512 (Why is no real title available?)
- Cycles through vertices of large maximum degree
- Circuits through prescribed vertices in k‐connected k‐regular graphs
- scientific article; zbMATH DE number 1775051 (Why is no real title available?)
- Long cycles passing through \(\lfloor\frac{4k+1}3\rfloor\) vertices in \(k\)-connected graphs
- scientific article; zbMATH DE number 2147940 (Why is no real title available?)
- scientific article; zbMATH DE number 750699 (Why is no real title available?)
- n-arc connected graphs
- scientific article; zbMATH DE number 4189769 (Why is no real title available?)
- Long paths through specified vertices in \(3\)-connected graphs
- Long paths and cycles passing through specified vertices under the average degree condition
- Paths through K-specified edges in a linear graph
- Heavy fans, cycles and paths in weighted graphs of large connectivity
- On the Hadwiger's conjecture for graph products
- A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs
- On short paths through prescribed vertices of a graph
- Cycles through 4 vertices in 3-connected graphs
This page was built for publication: Cycles and paths through specified vertices in k-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1116957)
