Cycles in -traceable oriented graphs
Authors:
- Susan A. van AardtSASusan A. van Aardt
- Marietjie FrickMFMarietjie Frick
- Morten H. NielsenMNMorten H. Nielsen
- 1 October 2011
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 311 (18-19) , 2085-2094
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Traceability of k-traceable oriented graphsDiscrete Mathematics, 2010
- A Traceability Conjecture for Oriented GraphsThe Electronic Journal of Combinatorics, 2008
- The Path Partition Conjecture is true for claw-free graphsDiscrete Mathematics, 2007
- Longest path partitions in generalizations of tournamentsDiscrete Mathematics, 2006
- The directed path partition conjectureDiscussiones Mathematicae Graph Theory, 2005
- In-Tournament DigraphsJournal of Combinatorial Theory, Series B, 1993
- When the cartesian product of two directed cycles is hypo-HamiltonianJournal of Graph Theory, 1983
- On Subtournaments of a TournamentCanadian Mathematical Bulletin, 1966