Hypotraceable digraphs

DOI10.1002/jgt.3190040406zbMath0453.05030OpenAlexW4244098736MaRDI QIDQ3900092

Martin Grötschel, Carsten Thomassen, Yoshiko Wakabayashi

Publication date: 1980

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190040406

zbMATH Keywords

complete subdigraphshypo-Hamiltonian digraphshypotraceable digraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

On k-optimum dipath partitions and partial k-colourings of acyclic digraphs ⋮ Planar hypohamiltonian oriented graphs ⋮ Traceability of \(k\)-traceable oriented graphs ⋮ The order of hypotraceable oriented graphs ⋮ Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs

Cites Work

• On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets
• On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets
• Flip-Flops in Hypohamiltonian Graphs

This page was built for publication: Hypotraceable digraphs