Disjoint chorded cycles in graphs
type: Item
instance of: scholarly article
title: Disjoint chorded cycles in graphs
zbMATH Open document ID: 1229.05163
author: Arie Bialostocki
author: Daniel Finkel
author: András Gyárfás
published in: Discrete Mathematics
publication date: 2009-01-28T00:00:00Z
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5499868
zbMATH Keywords: cycles
zbMATH Keywords: cycles with chords
MaRDI profile type: Publication
full work available at URL: j.disc.2007.10.040
OpenAlex ID: W2001686801
cites work: On independent cycles and edges in graphs
cites work: Q4842721
cites work: On the maximal number of independent circuits in a graph
cites work: Q3826605
cites work: Q4276003
cites work: Q5342985
DOI: 10.1016/J.DISC.2007.10.040
Recommended article: Disjoint cycles with chords in graphs
Recommended article: Vertex-disjoint chorded cycles in a graph
Recommended article: Disjoint cycles and chorded cycles in a graph with given minimum degree
Recommended article: Disjoint chorded cycles in graphs with high Ore-degree
Recommended article: Edge disjoint cycles in graphs
Recommended article: Q3582097
Recommended article: Q4262231
Recommended article: On the existence of disjoint cycles in a graph
Recommended article: Disjoint long cycles in a graph
Recommended article: Disjoint cycles in star-free graphs
description: scientific article; zbMATH DE number 5499868