On short paths through prescribed vertices of a graph
type: Item
instance of: scholarly article
title: On short paths through prescribed vertices of a graph
zbMATH Open document ID: 1115.05049
author: Erhard Hexel
published in: Discrete Mathematics
publication date: 2007-03-02T00:00:00Z
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5130450
zbMATH Keywords: cycle
zbMATH Keywords: planar graph
MaRDI profile type: Publication
full work available at URL: j.disc.2005.11.040
OpenAlex ID: W3210470417
cites work: Cycles through specified vertices
cites work: Q4947393
cites work: 4‐chrome Graphen und vollständige 4‐Graphen
cites work: On short cycles through prescribed vertices of a graph
cites work: On paths and cycles through specified vertices
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.2005.11.040
description: scientific article; zbMATH DE number 5130450