Cycles through specified vertices
From MaRDI portal
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
(42)- Disjoint cycles with partial degree conditions in claw-free graphs
- Partial degree conditions and cycle coverings in bipartite graphs
- Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
- A minimum degree condition for wheels
- Locally pancyclic graphs
- Cycles through subsets with large degree sums
- Heavy subgraph conditions for longest cycles to be heavy in graphs
- Large degree vertices in longest cycles of graphs. I
- Weakly pancyclic graphs
- Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
- Minimum degree conditions for cycles including specified sets of vertices
- scientific article; zbMATH DE number 1865919 (Why is no real title available?)
- Set-orderedness as a generalization of \(k\)-orderedness and cyclability
- A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs
- On the complexity of \(k\)-rainbow cycle colouring problems
- Cycles through given vertices and closures
- Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
- Long paths with endpoints in given vertex-subsets of graphs
- Disjoint cycles in hypercubes with prescribed vertices in each cycle
- Long cycles in subgraphs with prescribed minimum degree
- On short paths through prescribed vertices of a graph
- A \(k\)-tree containing specified vertices
- A degree condition for cycles passing through specified vertices and edges
- Hamilton cycles in almost distance-hereditary graphs
- Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws†
- A look at cycles containing specified elements of a graph
- Large degree vertices in longest cycles of graphs. II
- Relative length of longest paths and longest cycles in triangle-free graphs
- Degree conditions and degree bounded trees
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Long cycles through specified vertices
- On paths and cycles through specified vertices
- Hamilton cycles in claw-heavy graphs
- Dirac's minimum degree condition restricted to claws
- Disjoint Cycles in a Digraph with Partial Degree
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- Trees through specified vertices
- Graphs with large maximum degree containing no odd cycles of a given length
- On cycles through specified vertices
- Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- The longest cycles in a graph G with minimum degree at least \(| G| /k\)
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)
