| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
Progress on the traceability conjecture for oriented graphs
Abstract : 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.
Cited literature [9 references]
https://hal.inria.fr/hal-00972339
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2014 - 4:16:05 PM
Last modification on : Monday, October 19, 2020 - 8:00:03 PM
Long-term archiving on: : Thursday, July 3, 2014 - 4:41:01 PM
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2014 - 4:16:05 PM
Last modification on : Monday, October 19, 2020 - 8:00:03 PM
Long-term archiving on: : Thursday, July 3, 2014 - 4:41:01 PM
File
965-3520-1-PB.pdf
Files produced by the author(s)