Cycle decompositions IV: complete directed graphs and fixed length directed cycles

Author： Alspach B.   Gavlas H.   Sajna M.   Verrall H.  

Publisher： Elsevier

ISSN： 0097-3165

Source： Journal of Combinatorial Theory, Series A, Vol.103, Iss.1, 2003-07, pp. : 165-208

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Algorithms to Compute Minimum Cycle Basis in Directed Graphs

By Kavitha Telikepalli  

Theory of Computing Systems, Vol. 40, Iss. 4, 2007-06 ,pp. : 485-505

Springer Publishing Company

Access to resources Recommend Favorite

DECOMPOSITIONS OF GENERALIZED COMPLETE GRAPHS

By  

Bulletin of the Australian Mathematical Society, Vol. 80, Iss. 3, 2009-12 ,pp. : 523-525

Cambridge University Press

Access to resources Recommend Favorite

Algebraic connectivity of directed graphs

By Wu Chai Wah  

Linear and Multilinear Algebra, Vol. 53, Iss. 3, 2005-06 ,pp. : 203-223

Taylor & Francis Ltd

Access to resources Recommend Favorite

Graphs without cycles of even length

By  

Bulletin of the Australian Mathematical Society, Vol. 63, Iss. 3, 2001-06 ,pp. : 435-440

Cambridge University Press

Access to resources Recommend Favorite

A Note on A Family of Directed Strongly Regular Graphs

By Hobart S.A.   Justin Shaw T.  

European Journal of Combinatorics, Vol. 20, Iss. 8, 1999-11 ,pp. : 819-820

Elsevier

Access to resources Recommend Favorite