Cycles through specified vertices

DOI10.1007/BF01303200zbMATH Open0780.05033MaRDI QIDQ684399FDOQ684399

Authors: Béla Bollobás, Graham Brightwell 

Publication date: 15 September 1993

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

extremal graphslong cycles

Mathematics Subject Classification ID

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

Cites Work

• Some Theorems on Abstract Graphs
• 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

Cited In (42)

• Disjoint cycles with partial degree conditions in claw-free graphs
• Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
• Partial degree conditions and cycle coverings in bipartite graphs
• A minimum degree condition for wheels
• Locally pancyclic graphs
• Cycles through subsets with large degree sums
• Weakly pancyclic graphs
• Heavy subgraph conditions for longest cycles to be heavy in graphs
• Large degree vertices in longest cycles of graphs. I
• Title not available (Why is that?)
• Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
• Minimum degree conditions for cycles including specified sets of vertices
• 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
• Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
• Cycles through given vertices and closures
• 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 degree condition for cycles passing through specified vertices and edges
• Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws†
• A \(k\)-tree containing specified vertices
• Hamilton cycles in almost distance-hereditary graphs
• Large degree vertices in longest cycles of graphs. II
• A look at cycles containing specified elements of a graph
• 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
• Disjoint Cycles in a Digraph with Partial Degree
• On paths and cycles through specified vertices
• Hamilton cycles in claw-heavy graphs
• Forbidden subgraphs for longest cycles to contain vertices with large degrees
• Dirac's minimum degree condition restricted to claws
• 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)