A look at cycles containing specified elements of a graph
From MaRDI portal
Publication:1045026
DOI10.1016/j.disc.2008.04.017zbMath1229.05169OpenAlexW2126610278MaRDI QIDQ1045026
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.017
Related Items (17)
Cyclability in graph classes ⋮ A twelve vertex theorem for 3-connected claw-free graphs ⋮ Spanning Cycles Through Specified Edges in Bipartite Graphs ⋮ Partitioning a Graph into Highly Connected Subgraphs ⋮ Partial degree conditions and cycle coverings in bipartite graphs ⋮ Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs ⋮ Disjoint cycles covering specified vertices in bipartite graphs with partial degrees ⋮ Cyclability, connectivity and circumference ⋮ A vertex cover with chorded 4-cycles ⋮ On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Cycle traversability for claw-free graphs and polyhedral maps ⋮ Unnamed Item ⋮ Chorded cycles ⋮ 7-connected graphs are 4-ordered ⋮ Hamiltonian cycles and dominating cycles passing through a linear forest ⋮ On independent doubly chorded cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycles through specified vertices
- Generalizing pancyclic and \(k\)-ordered graphs
- Minimum degree conditions for cycles including specified sets of vertices
- On cycles through prescribed vertices in weakly separable graphs
- Cycles through \(k+2\) vertices in \(k\)-connected graphs
- New sufficient conditions for cycles in graphs
- Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
- Pancyclic graphs and linear forests
- A generalization of a result of Häggkvist and Nicoghossian
- Cycles and paths through specified vertices in k-connected graphs
- Circuits through specified edges
- Cycles through specified vertices of a graph
- Hamiltonism, degree sum and neighborhood intersections
- Cycles through edges in cyclically \(k\)-connected cubic graphs
- On 2-factors containing 1-factors in bipartite graphs
- On \(F\)-Hamiltonian graphs
- An Ore-type condition for pancyclability
- Cycles through subsets with large degree sums
- Cycles through given vertices and closures
- Cycles through a prescribed vertex set in \(n\)-connected graphs.
- On a Hamiltonian cycle in which specified vertices are uniformly distributed
- A generalization of a theorem of Dirac
- On short cycles through prescribed vertices of a graph
- On paths and cycles through specified vertices
- Cycles through prescribed vertices with large degree sum
- Vertex-disjoint cycles containing specified edges
- Minimal degree and \((k,m)\)-pancyclic ordered graphs
- Pancyclic graphs. I
- A note on Hamiltonian circuits
- Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
- Tough graphs and Hamiltonian circuits.
- Vertex-disjoint 4-cycles containing specified edges in a bipartite graph
- Note on Hamilton Circuits
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Cyclability of r-regular r-connected graphs
- Cycles Through Prescribed and Forbidden Point Sets
- Cycles intersecting a prescribed vertex set
- 2‐neighborhoods and hamiltonian conditions
- Onk-ordered Hamiltonian graphs
- Two‐factors each component of which contains a specified vertex
- Vertex-disjoint cycles containing specified vertices in a bipartite graph
- Cyclability of 3-connected graphs
- Onk-ordered graphs
- Circuits through prescribed vertices in k‐connected k‐regular graphs
- Linear forests and ordered cycles
- Degree conditions for k‐ordered hamiltonian graphs
- Vertex‐disjoint cycles containing prescribed vertices
- Sequences, claws and cyclability of graphs
- k-ordered Hamiltonian graphs
- Generalization of a Theorem of Posa
- Cycles and Connectivity in Graphs
- An extremal problem for H‐linked graphs
- Some Theorems on Abstract Graphs
- Cyclability and pancyclability in bipartite graphs
This page was built for publication: A look at cycles containing specified elements of a graph
