Cycles through specified vertices
From MaRDI portal
The authors relax a minimum degree condition on a graph which guarantees long cycles and consider a set \(W\) of vertices with degree at least \(d\geq 1\), in a graph \(G\) with \(n\) vertices in total. Without imposing any further conditions on \(G\), it is shown that there is a cycle in \(G\) containing at least \(\bigl\lceil{| W|\over\lceil n/d\rceil- 1}\bigr\rceil\) vertices in \(W\). Extremal graphs are produced to show that the result is best possible.
Recommendations
- Long cycles in subgraphs with prescribed minimum degree
- The longest cycles in a graph G with minimum degree at least \(| G| /k\)
- On degree sum conditions for long cycles and cycles through specified vertices
- Large degree vertices in longest cycles of graphs. I
- Cycles containing many vertices of large degree
Cites work
Cited in
(46)- Hamilton cycles in claw-heavy graphs
- Degree conditions and degree bounded trees
- Trees through specified vertices
- A look at cycles containing specified elements of a graph
- The longest cycles in a graph G with minimum degree at least \(| G| /k\)
- Long cycles in subgraphs with prescribed minimum degree
- Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
- Locally pancyclic graphs
- Dirac's minimum degree condition restricted to claws
- Cycles through subsets with large degree sums
- Graphs with large maximum degree containing no odd cycles of a given length
- Cycles through given vertices and closures
- Weakly pancyclic graphs
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- On paths and cycles through specified vertices
- \(W_ v\) cycles in plane graphs
- Disjoint cycles with partial degree conditions in claw-free graphs
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- Partial degree conditions and cycle coverings in bipartite graphs
- On the complexity of \(k\)-rainbow cycle colouring problems
- Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
- Disjoint cycles in hypercubes with prescribed vertices in each cycle
- Relative length of longest paths and longest cycles in triangle-free graphs
- On cycles through specified vertices
- Long cycles through specified vertices
- A minimum degree condition for wheels
- Large degree vertices in longest cycles of graphs. I
- Heavy subgraph conditions for longest cycles to be heavy in graphs
- Hamilton cycles in almost distance-hereditary graphs
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- scientific article; zbMATH DE number 1865919 (Why is no real title available?)
- Large degree vertices in longest cycles of graphs. II
- Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws†
- Disjoint Cycles in a Digraph with Partial Degree
- Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
- A \(k\)-tree containing specified vertices
- A degree condition for cycles passing through specified vertices and edges
- Rainbow Hamiltonicity with large edge numbers
- Hamiltonian cycles through a linear forest in bipartite graphs
- Minimum degree conditions for cycles including specified sets of vertices
- Set-orderedness as a generalization of \(k\)-orderedness and cyclability
- Cycles and paths through specified vertices in graphs with a given clique number
- A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs
- On short paths through prescribed vertices of a graph
- Long paths with endpoints in given vertex-subsets of graphs
- Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
This page was built for publication: Cycles through specified vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q684399)
