Cycles through specified vertices

DOI10.1007/BF01303200zbMath0780.05033MaRDI QIDQ684399

Béla Bollobás, Graham R. Brightwell

Publication date: 15 September 1993

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

extremal graphslong cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (36)

Disjoint Cycles in a Digraph with Partial Degree ⋮ Large degree vertices in longest cycles of graphs. I ⋮ Heavy subgraph conditions for longest cycles to be heavy in graphs ⋮ On paths and cycles through specified vertices ⋮ Hamilton cycles in almost distance-hereditary graphs ⋮ Dirac's minimum degree condition restricted to claws ⋮ Cycles through subsets with large degree sums ⋮ A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs ⋮ On short paths through prescribed vertices of a graph ⋮ A \(k\)-tree containing specified vertices ⋮ Partial degree conditions and cycle coverings in bipartite graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Disjoint cycles covering specified vertices in bipartite graphs with partial degrees ⋮ A degree condition for cycles passing through specified vertices and edges ⋮ On the complexity of \(k\)-rainbow cycle colouring problems ⋮ Graphs with large maximum degree containing no odd cycles of a given length ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity ⋮ Disjoint cycles in hypercubes with prescribed vertices in each cycle ⋮ Long paths with endpoints in given vertex-subsets of graphs ⋮ Unnamed Item ⋮ Relative length of longest paths and longest cycles in triangle-free graphs ⋮ Set-orderedness as a generalization of \(k\)-orderedness and cyclability ⋮ On cycles through specified vertices ⋮ Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws† ⋮ Forbidden subgraphs and the existence of paths and cycles passing through specified vertices ⋮ Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem ⋮ Hamilton cycles in claw-heavy graphs ⋮ Degree conditions and degree bounded trees ⋮ Weakly pancyclic graphs ⋮ Trees through specified vertices ⋮ A look at cycles containing specified elements of a graph ⋮ Large degree vertices in longest cycles of graphs II ⋮ Locally pancyclic graphs ⋮ Disjoint cycles with partial degree conditions in claw-free graphs ⋮ Forbidden subgraphs for longest cycles to contain vertices with large degrees

Cites Work

• The longest cycles in a graph G with minimum degree at least \(| G| /k\)
• The longest cycle of a graph with a large minimal degree
• Some Theorems on Abstract Graphs

This page was built for publication: Cycles through specified vertices