Hypotraceable digraphs

@article{Grtschel1980HypotraceableD,
  title={Hypotraceable digraphs},
  author={Martin Gr{\"o}tschel and Carsten Thomassen and Yoshiko Wakabayashi},
  journal={Journal of Graph Theory},
  year={1980},
  volume={4},
  pages={377-381}
}
A hypotraceable digraph is a digraph D = ( V , E ) which is not traceable, i.e., does not contain a (directed)Hamiltonian path, but for which D v is traceable for all V E V. We prove that a hypotraceable digraph of order n exists iff n r 7 and that for each k r 3 there are infinitely many hypotraceable oriented graphs with a source and a sink and precisely k strong components. We also show that there are strongly connected hypotraceable oriented graphs and that there are hypotraceable digraphs… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Hypohamiltonian graphs and digraphs

  • C . Thomassen
  • In Theory and Applications of Graphs, Michigan,
  • 1976

Monthly research problems, 1969-1973

  • R. R. Guy
  • Arner. Math. Monthly
  • 1973

Flip - flops in hypohamiltonian graphs

  • J. B. Collier, E. F. Schmeichel
  • Discrete Math .

Wakabayashi , On the structure of the monotone asymmetric travelling salesman polytope 11 : hypotraceable facets

  • Y.
  • Problkmes Combinatoires et Theorie des Graphes…

Similar Papers

Loading similar papers…