Results and problems on chorded cycles: a survey
From MaRDI portal
Publication:2102760
Recommendations
- Does there exist an algorithm which to each Diophantine equation assigns an integer which is greater than the modulus of integer solutions, if these solutions form a finite set?
- Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation
- scientific article; zbMATH DE number 1104003
- An Algorithm for Solving a Certain Class of Diophantine Equations. I
- The Diophantine equation đŒâ^{đ„â}âŻđŒ_{đ}^{đ„_{đ}}=đ(đ„â,âŠ,đ„_{đ}). II
Cites work
- K4ââfactor in a graph
- A cycle of maximum order in a graph of high minimum degree has a chord
- A note on a conjecture about cycles with many incident chords
- A note on extending Bondy's meta-conjecture
- A refinement of theorems on vertex-disjoint chorded cycles
- Bipartite graph tiling
- Characterizing forbidden pairs for hamiltonian properties
- Chorded cycles
- Chorded pancyclic properties in claw-free graphs
- Chorded pancyclicity in \(k\)-partite graphs
- Chords in longest cycles
- Chords of longest circuits in 3-connected graphs
- Chords of longest circuits in locally planar graphs
- Chords of longest circuits of graphs embedded in torus and Klein bottle
- Chords of longest cycles in cubic graphs
- Cycles in graphs. (Workshop Cycles in Graphs held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
- Cycles with a chord in dense graphs
- Decompositions of graphs into cycles with chords
- Degree conditions for 2-factors
- Degree sum conditions and vertex-disjoint cycles in a graph
- Disjoint chorded cycles in graphs
- Disjoint chorded cycles in graphs with high Ore-degree
- Disjoint Chorded Cycles of the Same Length
- Disjoint cycles and chorded cycles in a graph with given minimum degree
- Disjoint cycles with chords in graphs
- Every longest circuit of a 3âconnected,K3,3âminor free graph has a chord
- Extending cycles in graphs
- Extending vertex and edge pancyclic graphs
- Forbidden subgraphs for chorded pancyclicity
- Generalizing pancyclic and k-ordered graphs
- Girth in graphs
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3455294 (Why is no real title available?)
- scientific article; zbMATH DE number 914171 (Why is no real title available?)
- scientific article; zbMATH DE number 6271443 (Why is no real title available?)
- scientific article; zbMATH DE number 2197942 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- Independet cycles and chorded cycles in graphs
- Longest cycles and their chords
- Multiply chorded cycles
- Neighborhood unions and disjoint chorded cycles in graphs
- Neighborhood unions for the existence of disjoint chorded cycles in graphs
- Note on Hamilton Circuits
- On a sharp degree sum condition for disjoint chorded cycles in graphs
- On degree sum conditions and vertex-disjoint chorded cycles
- On independent doubly chorded cycles
- On independent triples and vertex-disjoint chorded cycles in graphs
- On the existence of disjoint cycles in a graph
- On the maximal number of independent circuits in a graph
- On the maximum number of independent cycles in a graph
- On the number of independent chorded cycles in a graph
- Pancyclic graphs and linear forests
- Pancyclic graphs. I
- Pancyclism in ChvĂĄtal-ErdĆs' graphs
- Partitioning a graph into cycles with a specified number of chords
- Regular graphs of large girth and arbitrary degree
- The Chvåtal-Erdös condition for cycles in triangle-free graphs
- The confirmation of a conjecture on disjoint cycles in a graph
- The edge condition for independent cycles with chords in bipartite graphs
- The extremal question for cycles with chords
- Twoâfactors each component of which contains a specified vertex
- Vertex pancyclic graphs
- Vertex-disjoint chorded cycles in a graph
- Vertex-disjoint cycles containing specified edges
- Vertex-disjoint cycles of the same length
- Vertex-disjoint cycles of the same length.
- Vertex-disjoint double chorded cycles in bipartite graphs
- Vertex-disjoint hexagons with chords in a bipartite graph
- Weakly pancyclic graphs
- Weakly pancyclic graphs
Cited in
(14)- Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation
- scientific article; zbMATH DE number 6007735 (Why is no real title available?)
- Chorded pancyclicity with distance two degree condition and doubly chorded pancyclicity
- Answers to Gould's question concerning the existence of chorded cycles
- Chorded edge pancyclicity and chorded vertex pancyclicity with the distance two degree condition
- A note on a spectral condition for the existence of Kâ Pâ
- Extremal function of two independent chorded cycles in a bipartite graph
- The A_-spectral radius of graphs with chorded cycles
- Signless Laplacian index conditions for trebly chorded cycles in graphs with given order
- A Fan-type degree condition for the existence of disjoint chorded cycles in a graph
- A general theorem in spectral extremal graph theory
- Spectral radius of bipartite graphs with chorded cycles
- Disjoint chorded cycles in a 2-connected graph
- Chorded bipancyclicity for degree-sum conditions of two vertices with distance two in balanced bipartite graphs
This page was built for publication: Results and problems on chorded cycles: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102760)
