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