A look at cycles containing specified elements of a graph
From MaRDI portal
Recommendations
Cites work
- 2‐neighborhoods and hamiltonian conditions
- A generalization of a result of Häggkvist and Nicoghossian
- A generalization of a theorem of Dirac
- A note on Hamiltonian circuits
- An extremal problem for H‐linked graphs
- An Ore-type condition for pancyclability
- Circuits through prescribed vertices in k‐connected k‐regular graphs
- Circuits through specified edges
- Cyclability and pancyclability in bipartite graphs
- Cyclability of r-regular r-connected graphs
- Cyclability of 3-connected graphs
- Cycles and Connectivity in Graphs
- Cycles and paths through specified vertices in k-connected graphs
- Cycles containing given subsets in 1-tough graphs.
- Cycles intersecting a prescribed vertex set
- Cycles through k+2 vertices in k-connected graphs
- Cycles through a prescribed vertex set in \(n\)-connected graphs.
- Cycles through edges in cyclically \(k\)-connected cubic graphs
- Cycles through given vertices and closures
- Cycles Through Prescribed and Forbidden Point Sets
- Cycles through prescribed vertices with large degree sum
- Cycles through specified vertices
- Cycles through specified vertices of a graph
- Cycles through subsets with large degree sums
- Degree conditions for k‐ordered hamiltonian graphs
- Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
- Generalization of a Theorem of Posa
- Generalizing pancyclic and k-ordered graphs
- Hamiltonian cycles containing ordered linear forests
- Hamiltonism, degree sum and neighborhood intersections
- scientific article; zbMATH DE number 3722690 (Why is no real title available?)
- scientific article; zbMATH DE number 3730183 (Why is no real title available?)
- scientific article; zbMATH DE number 3783043 (Why is no real title available?)
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 1792643 (Why is no real title available?)
- scientific article; zbMATH DE number 2114101 (Why is no real title available?)
- scientific article; zbMATH DE number 2199618 (Why is no real title available?)
- scientific article; zbMATH DE number 3215865 (Why is no real title available?)
- scientific article; zbMATH DE number 5036076 (Why is no real title available?)
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- k-ordered Hamiltonian graphs
- Linear forests and ordered cycles
- Long paths and cycles through specified vertices in k-connected graphs.
- Minimal degree and \((k,m)\)-pancyclic ordered graphs
- Minimum degree conditions for cycles including specified sets of vertices
- Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.
- New sufficient conditions for cycles in graphs
- Note on Hamilton Circuits
- On \(F\)-Hamiltonian graphs
- On 2-factors containing 1-factors in bipartite graphs
- On a Hamiltonian cycle in which specified vertices are uniformly distributed
- On cycles through prescribed vertices in weakly separable graphs
- On paths and cycles through specified vertices
- On short cycles through prescribed vertices of a graph
- Onk-ordered graphs
- Onk-ordered Hamiltonian graphs
- Pancyclic graphs and linear forests
- Pancyclic graphs. I
- Regular n-valent n-connected non-Hamiltonian non n-edge-colourable graphs
- Sequences, claws and cyclability of graphs
- Some Theorems on Abstract Graphs
- Tough graphs and Hamiltonian circuits.
- Two‐factors each component of which contains a specified vertex
- Vertex-disjoint 4-cycles containing specified edges in a bipartite graph
- Vertex-disjoint cycles containing specified edges
- Vertex-disjoint cycles containing specified edges in a bipartite graph
- Vertex-disjoint cycles containing specified vertices in a bipartite graph
- Vertex‐disjoint cycles containing prescribed vertices
Cited in
(17)- Hamiltonian cycles and dominating cycles passing through a linear forest
- A vertex cover with chorded 4-cycles
- Cycle traversability for claw-free graphs and polyhedral maps
- 7-connected graphs are 4-ordered
- On independent doubly chorded cycles
- Partial degree conditions and cycle coverings in bipartite graphs
- Recent advances on the Hamiltonian problem: survey III
- Spanning cycles through specified edges in bipartite graphs
- A twelve vertex theorem for 3-connected claw-free graphs
- Partitioning a graph into highly connected subgraphs
- Improved degree conditions for 2-factors with k cycles in Hamiltonian graphs
- On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs
- Chorded cycles
- Disjoint cycles through prescribed vertices in multidimensional tori
- Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
- Cyclability, connectivity and circumference
- Cyclability in graph classes
This page was built for publication: A look at cycles containing specified elements of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045026)
