Marietjie Frick ; Peter Katrenič - Progress on the traceability conjecture for oriented graphs

dmtcs:428 - Discrete Mathematics & Theoretical Computer Science, January 1, 2008, Vol. 10 no. 3 -
Progress on the traceability conjecture for oriented graphs

Authors: Marietjie Frick ORCID-iD1; Peter Katrenič 2

  • 1 Department of Mathematical Sciences [South Africa]
  • 2 Institute of Mathematics [Kosice, Slovakia]

A digraph is k-traceable if each of its induced subdigraphs of order k is traceable. The Traceability Conjecture is that for k ≥ 2 every k-traceable oriented graph of order at least 2k − 1 is traceable. The conjecture has been proved for k ≤ 5. We prove that it also holds for k = 6.

Volume: Vol. 10 no. 3
Section: Graph and Algorithms
Published on: January 1, 2008
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1016/0012-365x(83)90188-7
  • 10.1016/0012-365x(83)90188-7
Every finite strongly connected digraph of stability 2 has a Hamiltonian path

Consultation statistics

This page has been seen 206 times.
This article's PDF has been downloaded 248 times.