Results and problems on chorded cycles: a survey

DOI10.1007/s00373-022-02586-9zbMath1502.05105OpenAlexW4309583151MaRDI QIDQ2102760

Ronald J. Gould

Publication date: 29 November 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02586-9

zbMATH Keywords

cyclechordpancyclicchorded cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (1)

Unnamed Item

Uses Software

• cyclechord

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
• Neighborhood unions for the existence of disjoint chorded cycles in graphs
• Regular graphs of large girth and arbitrary degree
• Chorded cycles
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• Vertex-disjoint chorded cycles in a graph
• Chords in longest cycles
• Generalizing pancyclic and \(k\)-ordered graphs
• Extending cycles in graphs
• Neighborhood unions and disjoint chorded cycles in graphs
• Girth in graphs
• Pancyclism in Chvátal-Erdős' graphs
• Chords of longest circuits in locally planar graphs
• Disjoint chorded cycles in graphs
• Pancyclic graphs and linear forests
• Cycles in graphs. (Workshop Cycles in Graphs held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
• On the maximum number of independent cycles in a graph
• On the existence of disjoint cycles in a graph
• Characterizing forbidden pairs for hamiltonian properties
• Chords of longest cycles in cubic graphs
• Chords of longest circuits in 3-connected graphs
• Vertex-disjoint cycles of the same length.
• Weakly pancyclic graphs
• Vertex-disjoint hexagons with chords in a bipartite graph
• Vertex pancyclic graphs
• Cycles with a chord in dense graphs
• The confirmation of a conjecture on disjoint cycles in a graph
• Decompositions of graphs into cycles with chords
• A cycle of maximum order in a graph of high minimum degree has a chord
• Chorded pancyclicity in \(k\)-partite graphs
• Extending vertex and edge pancyclic graphs
• The Chvátal-Erdös condition for cycles in triangle-free graphs
• Vertex-disjoint cycles of the same length
• Vertex-disjoint cycles containing specified edges
• Disjoint cycles and chorded cycles in a graph with given minimum degree
• The edge condition for independent cycles with chords in bipartite graphs
• Disjoint chorded cycles in graphs with high Ore-degree
• Vertex-disjoint double chorded cycles in bipartite graphs
• On independent doubly chorded cycles
• A refinement of theorems on vertex-disjoint chorded cycles
• Forbidden subgraphs for chorded pancyclicity
• Independet cycles and chorded cycles in graphs
• On the number of independent chorded cycles in a graph
• Pancyclic graphs. I
• On degree sum conditions and vertex-disjoint chorded cycles
• Note on Hamilton Circuits
• Bipartite Graph Tiling
• Disjoint cycles with chords in graphs
• Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord
• Longest cycles and their chords
• Weakly pancyclic graphs
• Degree conditions for 2-factors
• Two‐factors each component of which contains a specified vertex
• A note on a conjecture about cycles with many incident chords
• K₄⁻‐factor in a graph
• Chords of longest circuits of graphs embedded in torus and Klein bottle
• Multiply Chorded Cycles
• Partitioning a graph into cycles with a specified number of chords
• Disjoint Chorded Cycles of the Same Length
• On the maximal number of independent circuits in a graph

This page was built for publication: Results and problems on chorded cycles: a survey