Neighborhood unions and disjoint chorded cycles in graphs
From MaRDI portal
Publication:764874
DOI10.1016/j.disc.2011.10.012zbMath1237.05117MaRDI QIDQ764874
Publication date: 16 March 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.10.012
05C38: Paths and cycles
Related Items
Decompositions of graphs into cycles with chords, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, A refinement of theorems on vertex-disjoint chorded cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a sharp degree sum condition for disjoint chorded cycles in graphs
- Disjoint chorded cycles in graphs
- On the maximum number of independent cycles in a graph
- On the existence of disjoint cycles in a graph
- On the number of independent chorded cycles in a graph
- Disjoint cycles with chords in graphs
- On the maximal number of independent circuits in a graph