On paths and cycles through specified vertices
type: Item
instance of: scholarly article
title: On paths and cycles through specified vertices
zbMATH Open document ID: 1048.05050
author: Jochen Harant
published in: Discrete Mathematics
publication date: 2004-10-01T00:00:00Z
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 2105616
zbMATH Keywords: Connectivity
zbMATH Keywords: Path
zbMATH Keywords: Cycle
zbMATH Keywords: Specified vertices
MaRDI profile type: Publication
full work available at URL: j.disc.2003.11.059
OpenAlex ID: W2002648124
cites work: Menger's theorem
cites work: Cycles through specified vertices
cites work: Cycles through subsets with large degree sums
cites work: A note on Hamiltonian circuits
cites work: Q4947393
cites work: 4‐chrome Graphen und vollständige 4‐Graphen
cites work: A nine point theorem for 3-connected graphs
cites work: When m vertices in a k-connected graph cannot be walked round along a simple cycle
cites work: Long paths and cycles through specified vertices in \(k\)-connected graphs.
DOI: 10.1016/J.DISC.2003.11.059
description: scientific article; zbMATH DE number 2105616