Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
type: Item
instance of: scholarly article
title: Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
zbMATH Open document ID: 1298.05152
author: Susan Van Aardt
author: Marietjie Frick
author: Bernardo Llano
author: A. P. Burger
author: Rita Zuazua
published in: Graphs and Combinatorics
publication date: 2014-09-19T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6346013
zbMATH Keywords: hypohamiltonian
zbMATH Keywords: 2-hypohamiltonian
zbMATH Keywords: hypo-hypohamiltonian
zbMATH Keywords: hypotraceable
zbMATH Keywords: 2-hypotraceable
zbMATH Keywords: hypo-hypotraceable
zbMATH Keywords: traceability conjecture
zbMATH Keywords: path partition conjecture
MaRDI profile type: Publication
full work available at URL: s00373-013-1312-1
OpenAlex ID: W2031908930
cites work: An iterative approach to the traceability conjecture for oriented graphs
cites work: An infinite family of planar hypohamiltonian oriented graphs
cites work: Traceability of \(k\)-traceable oriented graphs
cites work: A traceability conjecture for oriented graphs
cites work: The order of hypotraceable oriented graphs
cites work: Digraphs
cites work: Computational results on the traceability of oriented graphs of small order
cites work: Q3575434
cites work: Hypotraceable digraphs
cites work: Q3318807
cites work: Vertices missed by longest paths or circuits
cites work: On non-Hamiltonian circulant digraphs of outdegree three
cites work: When the cartesian product of two directed cycles is hypo-Hamiltonian
cites work: Q5786055
cites work: Q4351082
cites work: Q4146745
cites work: A two-connected planar graph without concurrent longest paths
cites work: On longest paths and circuits in graphs.
DOI: 10.1007/S00373-013-1312-1
description: scientific article; zbMATH DE number 6346013