On commutativity of two unary digraph operations : Subdividing and line-digraphingFUJI ZHANG; ZHIBO CHEN.Discrete mathematics. 2006, Vol 306, Num 21, pp 2733-2739, issn 0012-365X, 7 p.Article

Kernels in quasi-transitive digraphsGALEANA-SANCHEZ, Hortensia; ROJAS-MONROY, Rocio.Discrete mathematics. 2006, Vol 306, Num 16, pp 1969-1974, issn 0012-365X, 6 p.Article

Diameter vulnerability of iterated line digraphs in terms of the girthBALBUENA, C; MARCOTE, X; FERRERO, D et al.Networks (New York, NY). 2005, Vol 45, Num 2, pp 49-54, issn 0028-3045, 6 p.Article

Generalized exponents of primitive two-colored digraphsYUBIN GAO; YANLING SHAO.Linear algebra and its applications. 2009, Vol 430, Num 5-6, pp 1550-1565, issn 0024-3795, 16 p.Conference Paper

Some results on the spectral radius of generalized ∞ and θ-digraphsGUANGQUAN GUO; JUAN LIU.Linear algebra and its applications. 2012, Vol 437, Num 9, pp 2200-2208, issn 0024-3795, 9 p.Article

The structure of strong arc-locally in-semicomplete digraphsSHIYING WANG; RUIXIA WANG.Discrete mathematics. 2009, Vol 309, Num 23-24, pp 6555-6562, issn 0012-365X, 8 p.Article

On the structure of strong 3-quasi-transitive digraphsGALEANA-SANCHEZ, Hortensia; GOLDFEDER, Ilan A; URRUTIA, Isabel et al.Discrete mathematics. 2010, Vol 310, Num 19, pp 2495-2498, issn 0012-365X, 4 p.Article

Double vertex digraphs of digraphsYUBIN GAO; YANLING SHAO.Discrete mathematics. 2009, Vol 309, Num 8, pp 2432-2444, issn 0012-365X, 13 p.Article

Wielandt type theorem for Cartesian product of digraphsBYEONG MOON KIM; BYUNG CHUL SONG; HWANG, Woonjae et al.Linear algebra and its applications. 2008, Vol 429, Num 4, pp 841-848, issn 0024-3795, 8 p.Article

Exponents of two-colored digraphs with two cyclesYUBIN GAO; YANLING SHAO.Linear algebra and its applications. 2005, Vol 407, pp 263-276, issn 0024-3795, 14 p.Article

Longest path partitions in generalizations of tournamentsBANG-JENSEN, Jørgen; NIELSEN, Morten Hegner; YEO, Anders et al.Discrete mathematics. 2006, Vol 306, Num 16, pp 1830-1839, issn 0012-365X, 10 p.Article

Constant width planar computation characterizes ACC⁰HANSEN, Kristoffer Arnsfelt.Lecture notes in computer science. 2004, pp 44-55, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper

Embedding iterated line digraphs in booksHASUNUMA, Toru.Networks (New York, NY). 2002, Vol 40, Num 2, pp 51-62, issn 0028-3045Article

Chronological orderings of interval digraphsSEN, Malay; TALUKDAR, P; DAS, Sandip et al.Discrete mathematics. 2006, Vol 306, Num 14, pp 1601-1609, issn 0012-365X, 9 p.Conference Paper

A note on recursive properties of the de Bruijn, Kautz and FFT digraphsHEYDEMANN, M. C; SOTTEAU, D.Information processing letters. 1995, Vol 53, Num 5, pp 255-259, issn 0020-0190Article

Spanning 2-strong tournaments in 3-strong semicomplete digraphsBANG-JENSEN, Jorgen; JORDAN, Tibor.Discrete mathematics. 2010, Vol 310, Num 9, pp 1424-1428, issn 0012-365X, 5 p.Conference Paper

Bounds on the local bases of primitive, non-powerful, minimally strong signed digraphsHONGPING MA.Linear algebra and its applications. 2009, Vol 430, Num 2-3, pp 718-731, issn 0024-3795, 14 p.Article

Which Faber-Moore-Chen digraphs are Cayley digraphs?ZDIMALOVA, Mária; STANEKOVA, Lubica.Discrete mathematics. 2010, Vol 310, Num 17-18, pp 2238-2240, issn 0012-365X, 3 p.Article

The kth upper bases of primitive non-powerful signed digraphsYANLING SHAO; JIAN SHEN; YUBIN GAO et al.Discrete mathematics. 2009, Vol 309, Num 9, pp 2682-2686, issn 0012-365X, 5 p.Article

Large Vertex Symmetric DigraphsGOMEZ, J.Networks (New York, NY). 2007, Vol 50, Num 4, pp 241-250, issn 0028-3045, 10 p.Article

Characterizing the reconstruction and enumerating the patterns of DNA sequences with repeatsCHANG, Hsun-Wen; TSAI, Pei-Fang.Journal of combinatorial optimization. 2007, Vol 14, Num 2-3, pp 331-347, issn 1382-6905, 17 p.Conference Paper

A STEP TOWARD THE BERMOND-THOMASSEN CONJECTURE ABOUT DISJOINT CYCLES IN DIGRAPHSLICHIARDOPOL, Nicolas; POR, Attila; SERENI, Jean-Sébastien et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 2, pp 979-992, issn 0895-4801, 14 p.Article

A classification of circulant DCI(CI)-digraphs of 2-power orderQIONGXIANG HUANG.Discrete mathematics. 2003, Vol 265, Num 1-3, pp 71-84, issn 0012-365X, 14 p.Article

On semicomplete multipartite digraphs whose king sets are semicomplete digraphsTAN, B. P.Discrete mathematics. 2008, Vol 308, Num 12, pp 2564-2570, issn 0012-365X, 7 p.Article

Exponents of a class of two-colored digraphs with two cyclesFENGYING HUANG; BOLIAN LIU.Linear algebra and its applications. 2008, Vol 429, Num 2-3, pp 658-672, issn 0024-3795, 15 p.Article