Traceability of \(k\)-traceable oriented graphs
type: Item
instance of: scholarly article
title: Traceability of \(k\)-traceable oriented graphs
zbMATH Open document ID: 1195.05030
author: B. E. Eshmatov
published in: Discrete Mathematics
publication date: 2010-04-27T00:00:00Z
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 5701963
zbMATH Keywords: oriented graph
zbMATH Keywords: generalized tournament
zbMATH Keywords: traceable
zbMATH Keywords: hypotraceable
zbMATH Keywords: \(k\)-traceable
zbMATH Keywords: traceability conjecture
zbMATH Keywords: longest path
MaRDI profile type: Publication
full work available at URL: j.disc.2009.12.022
OpenAlex ID: W2046267970
cites work: Longest path partitions in generalizations of tournaments
cites work: Every finite strongly connected digraph of stability 2 has a Hamiltonian path
cites work: Q3575434
cites work: Independent sets and non-augmentable paths in generalizations of tournaments
cites work: Independent sets which meet all longest paths
cites work: Hypotraceable digraphs
cites work: Stable set meeting every longest path
cites work: Q3309863
cites work: The directed path partition conjecture
cites work: A traceability conjecture for oriented graphs
cites work: Q3105538
DOI: 10.1016/J.DISC.2009.12.022
description: scientific article; zbMATH DE number 5701963