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

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

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

An O (n log n) Algorithm for Maximum st-Flow in a Directed Planar GraphBORRADAILE, Glencora; KLEIN, Philip.Journal of the Association for Computing Machinery. 2009, Vol 56, Num 2, issn 0004-5411, 9.1-9.30Article

Hoàng-Reed conjecture holds for tournamentsHAVET, Frédéric; THOMASSE, Stéphan; YEO, Anders et al.Discrete mathematics. 2008, Vol 308, Num 15, pp 3412-3415, issn 0012-365X, 4 p.Article

On the Diameter of the Generalized Undirected de Bruijn Graphs UG_B(n, m), n² ≤ _n3KUO, Jyhmin; FU, Hung-Lin.Networks (New York, NY). 2008, Vol 52, Num 4, pp 180-182, issn 0028-3045, 3 p.Article

Acyclic Automata with Easy-to-Find Short Regular ExpressionsMORAIS, José Joao; MOREIRA, Nelina; REIS, Rogério et al.Lecture notes in computer science. 2006, pp 349-350, issn 0302-9743, isbn 3-540-31023-1, 1Vol, 2 p.Conference Paper

The external network problem with edge- or arc-connectivity requirementsVAN DEN HEUVEL, Jan; JOHNSON, Matthew.Lecture notes in computer science. 2005, pp 114-126, issn 0302-9743, isbn 3-540-27873-7, 13 p.Conference Paper

All 2-connected in-tournaments that are cycle complementaryMEIERLING, Dirk; VOLKMANN, Lutz.Discrete mathematics. 2008, Vol 308, Num 11, pp 2115-2133, issn 0012-365X, 19 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

The Number of Spanning Trees in a Class of Double Fixed-Step Loop NetworksXUERONG YONG; YUANPING ZHANG; GOLIN, Mordecai J et al.Networks (New York, NY). 2008, Vol 52, Num 2, pp 69-77, issn 0028-3045, 9 p.Article

Uniformly optimal digraphs for strongly connected reliabilityBROWN, J. I; XIAOHU LI.Networks (New York, NY). 2007, Vol 49, Num 2, pp 145-151, issn 0028-3045, 7 p.Article

Book embeddability of series-parallel digraphsDI GIACOMO, Emilio; DIDIMO, Walter; LIOTTA, Giuseppe et al.Algorithmica. 2006, Vol 45, Num 4, pp 531-547, issn 0178-4617, 17 p.Article

Bimodal Crossing MinimizationBUCHHEIM, Christoph; JÜNGER, Michael; MENZE, Annette et al.Lecture notes in computer science. 2006, pp 497-506, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

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

Strongly 4-path-connectivity in almost regular multipartite tournamentsSTELLA, Irene; VOLKMANN, Lutz; WINZEN, Stefan et al.Discrete mathematics. 2007, Vol 307, Num 24, pp 3213-3219, issn 0012-365X, 7 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

Characteristic polynomials of digraphs having a semi-free actionAIPING DENG; YAOKUN WU.Linear algebra and its applications. 2005, Vol 408, pp 189-206, issn 0024-3795, 18 p.Article

A New Algorithm for Finding Trees with Many LeavesKNEIS, Joachim; LANGER, Alexander; ROSSMANITH, Peter et al.Algorithmica. 2011, Vol 61, Num 4, pp 882-897, issn 0178-4617, 16 p.Conference Paper

Generalized scrambling indices of a primitive digraphYUFEI HUANG; BOLIAN LIU.Linear algebra and its applications. 2010, Vol 433, Num 11-12, pp 1798-1808, issn 0024-3795, 11 p.Article

On the interlace polynomials of forestsANDERSON, C; CUTLER, J; RADCLIFFE, A. J et al.Discrete mathematics. 2010, Vol 310, Num 1, pp 31-36, issn 0012-365X, 6 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

The Hoàng-Reed Conjecture for δ⁺ = 3WELHAN, Manuel.Discrete mathematics. 2010, Vol 310, Num 13-14, pp 1932-1939, issn 0012-365X, 8 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

On direct product cancellation of graphsHAMMACK, Richard H.Discrete mathematics. 2009, Vol 309, Num 8, pp 2538-2543, issn 0012-365X, 6 p.Article