Extending cycles in graphs
From MaRDI portal
Publication:750461
DOI10.1016/0012-365X(90)90163-CzbMath0714.05038MaRDI QIDQ750461
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (47)
Vertex pancyclic graphs ⋮ Pancyclic orderings of in-tournaments ⋮ Global cycle properties of locally isometric graphs ⋮ Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs ⋮ Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs ⋮ Degree conditions and cycle extendability ⋮ Claw-free graphs---a survey ⋮ Hamiltonian cycles in linear-convex supergrid graphs ⋮ Unnamed Item ⋮ Characterizing forbidden pairs for hamiltonian properties ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Extending cycles in bipartite graphs ⋮ Quasi-claw-free graphs ⋮ Pan-\(H\)-linked graphs ⋮ Vertex pancyclicity in quasi claw-free graphs ⋮ On Saito's conjecture and the Oberly-Sumner conjectures ⋮ Gallai-Ramsey number for the union of stars ⋮ On Hamiltonian properties of \(K_{1, r}\)-free split graphs ⋮ Further results on Hendry's Conjecture ⋮ Toughness and Hamiltonicity of strictly chordal graphs ⋮ Rainbow structures in a collection of graphs with degree conditions ⋮ Endpoint extendable paths in dense graphs ⋮ Hamiltonian properties of locally connected graphs with bounded vertex degree ⋮ \(c\)-pancyclic partial ordering and \((c-1)\)-pan-outpath partial ordering in semicomplete multipartite digraphs. ⋮ \(k\)-primitivity of digraphs ⋮ Rainbow vertex-pancyclicity of strongly edge-colored graphs ⋮ Hamilton cycles in sparse locally connected graphs ⋮ On the \(H\)-force number of Hamiltonian graphs and cycle extendability ⋮ Extending vertex and edge pancyclic graphs ⋮ Cycle extendability in graphs and digraphs ⋮ Extending cycles in directed graphs ⋮ A note on cycles in locally Hamiltonian and locally Hamilton-connected graphs ⋮ Hamiltonian properties of triangular grid graphs ⋮ Cycle Extendability of Hamiltonian Strongly Chordal Graphs ⋮ Toughness, forbidden subgraphs and pancyclicity ⋮ Vertex pancyclicity in quasi-claw-free graphs ⋮ Global cycle properties in graphs with large minimum clustering coefficient ⋮ Rainbow edge-pancyclicity of strongly edge-colored graphs ⋮ Cycle Extensions in BIBD Block-Intersection Graphs ⋮ Fully cycle extendability of \(K_{1,4}\)-restricted graphs ⋮ Vertex pancyclism in claw-free graphs ⋮ Connectivity and extendability in digraphs ⋮ Hamiltonian Chordal Graphs are not Cycle Extendable ⋮ Results and problems on chorded cycles: a survey ⋮ Path extendable graphs ⋮ Ramsey and Gallai-Ramsey number for wheels
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending cycles in directed graphs
- On rigid circuit graphs
- Arc coverings of graphs
- Extending cycles in bipartite graphs
- Forbidden subgraphs and Hamiltonian properties and graphs
- The square of a block is vertex pancyclic
- A method in graph theory
- In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
- A characterisation of rigid circuit graphs
- Pancyclic graphs. I
- Triangulated graphs and the elimination process
- Graphs in which every finite path is contained in a circuit
- The square of every two-connected graph is Hamiltonian
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Note on Hamilton Circuits
- The multiplicity of 1-factors in the square of a graph
- On the hamiltonian path graph of a graph
- The square of a connected S(K1,3)-free graph is vertex pancyclic
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Representations of chordal graphs as subtrees of a tree
- Hamiltonian Cycles in Squares of Vertex-Unicyclic Graphs
- Randomly Traceable Graphs
- Variations on the Hamiltonian Theme
- Some Theorems on Abstract Graphs
This page was built for publication: Extending cycles in graphs
