On a cycle through a specified linear forest of a graph
type: Item
instance of: scholarly article
title: On a cycle through a specified linear forest of a graph
zbMATH Open document ID: 1114.05052
author: Tobias Gerlach
author: Jochen Harant
published in: Discrete Mathematics
publication date: 2007-03-02T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5130448
zbMATH Keywords: connectivity
zbMATH Keywords: toughness
zbMATH Keywords: cycle
MaRDI profile type: Publication
full work available at URL: j.disc.2005.11.043
OpenAlex ID: W2019434459
cites work: Menger's theorem
cites work: Cycles through subsets with large degree sums
cites work: Q4947393
cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
cites work: Circuits through specified edges
cites work: On paths and cycles through specified vertices
cites work: Long cycles through a linear forest
cites work: One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
cites work: Cycles and Connectivity in Graphs
cites work: Circuits containing specified edges
DOI: 10.1016/J.DISC.2005.11.043
Recommended article: Partitions of a graph into cycles containing a specified linear forest
Recommended article: On a tree graph defined by a set of cycles
Recommended article: Linear forests and ordered cycles
Recommended article: Pancyclic graphs and linear forests
Recommended article: Hamiltonian cycles and dominating cycles passing through a linear forest
Recommended article: A degree sum condition for long cycles passing through a linear forest
Recommended article: Q5313246
Recommended article: Ciclos hamiltonianos que pasan a través de un bosque lineal en grafos bipartitos balanceados
Recommended article: Q3620654
Recommended article: On cycle transversals and their connected variants in the absence of a small linear forest
description: scientific article; zbMATH DE number 5130448