Disjoint chorded cycles in graphs
From MaRDI portal
Publication:998485
DOI10.1016/j.disc.2007.10.040zbMath1229.05163MaRDI QIDQ998485
Daniel Finkel, András Gyárfás, Arie Bialostocki
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.040
05C38: Paths and cycles
Related Items
On the Corrádi-Hajnal theorem and a question of Dirac, Neighborhood unions for the existence of disjoint chorded cycles in graphs, Chorded cycles, On a sharp degree sum condition for disjoint chorded cycles in graphs, The extremal function for two disjoint cycles, Neighborhood unions and disjoint chorded cycles in graphs, Sharp minimum degree conditions for the existence of disjoint theta graphs, Decompositions of graphs into cycles with chords, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Disjoint cliques in claw-free graphs, Results and problems on chorded cycles: a survey, Disjoint cycles and chorded cycles in a graph with given minimum degree, The edge condition for independent cycles with chords in bipartite graphs, On independent doubly chorded cycles, A refinement of theorems on vertex-disjoint chorded cycles, Minimum degree conditions for vertex-disjoint even cycles in large graphs, Disjoint Even Cycles Packing, Disjoint cycles with chords in graphs
Cites Work
