On the parameterized complexity of layered graph drawingDUJMOVIC, V; FELLOWS, M; WHITESIDES, S et al.Lecture notes in computer science. 2001, pp 488-499, issn 0302-9743, isbn 3-540-42493-8Conference Paper

On graceful directed graphsBLOOM, G. S; HSU, D. F.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 3, pp 519-536, issn 0196-5212Article

On random mapping patternsMEIR, A; MOON, J. W.Combinatorica (Print). 1984, Vol 4, Num 1, pp 61-70, issn 0209-9683Article

A family of perfect graphs associated with directed graphsKAHN, J.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 3, pp 279-282, issn 0095-8956Article

Superfluous paths in strong digraphsLUCCHESI, C. L; ROSS, J. A.Discrete mathematics. 1983, Vol 47, Num 2-3, pp 267-273, issn 0012-365XArticle

On the sum of all distances in a graph or digraphPLESNIK, J.Journal of graph theory. 1984, Vol 8, Num 1, pp 1-21, issn 0364-9024Article

Largest digraphs contained in all n-tournamentsLINIAL, N; SAKS, M; SOS, V. T et al.Combinatorica (Print). 1983, Vol 3, Num 1, pp 101-104, issn 0209-9683Article

Approximation algorithms for Steiner and directed multicutsKLEIN, P. N; PLOTKIN, S. A; RAO, S et al.Journal of algorithms (Print). 1997, Vol 22, Num 2, pp 241-269, issn 0196-6774Article

On the connectivity of the De Bruijn graphSRIDHAR, M. A.Information processing letters. 1988, Vol 27, Num 6, pp 315-318, issn 0020-0190Article

Codimension 1 orbits and semi-invariants for the representations of an oriented graph of type #7B-A_nABEASIS, S.Transactions of the American Mathematical Society. 1984, Vol 282, Num 2, pp 463-485, issn 0002-9947Article

Diperfect graphsBERGE, C.North-Holland mathematics studies. 1984, Vol 88, pp 45-56, issn 0304-0208Article

Réductibilité polynomiale des oracles de matroïdesISACHENKO, A. N.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1984, Num 6, pp 33-36, issn 0002-3574Article

Comments on an input/output approach to the structural analysis of digraphsDAVISON, E. J.IEEE transactions on systems, man, and cybernetics. 1983, Vol 13, Num 3, pp 432-433, issn 0018-9472Article

The Jordan canonical form for a class of zero-one matricesCARDON, David A; TUCKFIELD, Bradford.Linear algebra and its applications. 2011, Vol 435, Num 11, pp 2942-2954, issn 0024-3795, 13 p.Article

On a cyclic connectivity property of directed graphsHUBENKO, Alice.Discrete mathematics. 2008, Vol 308, Num 7, pp 1018-1024, issn 0012-365X, 7 p.Article

On the combinatorics of an origami modelLENGVARSZKY, Zsolt.Discrete mathematics. 2009, Vol 309, Num 12, pp 4169-4173, issn 0012-365X, 5 p.Article

A note on subdigraphs of digraphs with large outdegreesALON, N.Discrete mathematics. 1984, Vol 49, Num 3, pp 321-322, issn 0012-365XArticle

Hamiltonian cycles in striped graphs: the two-stripe problemGARFINKEL, R. S; SUNDARARAGHAVAN, P. S.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 4, pp 463-466, issn 0196-5212Article

Some machines defined by directed graphsDE BRUIJN, N. G.Theoretical computer science. 1984, Vol 32, Num 3, pp 309-319, issn 0304-3975Article

The signal flow graph method of goal programmingLEE, S. M; SHIM, J. P; LEE, C. S et al.Computers & operations research. 1984, Vol 11, Num 3, pp 253-265, issn 0305-0548Article

Automates finis et équirépartition modulo un = Finite automata and mod n equirepartitionMAUDUIT, Christian.1984, 27 pThesis

Graphs with relations, coverings and group-graded algebrasGREEN, E. L.Transactions of the American Mathematical Society. 1983, Vol 279, Num 1, pp 297-310, issn 0002-9947Article

Exact reliabilities of most reliable double-loop networksHWANG, F. K; WRIGHT, P. E; HU, X. D et al.Networks (New York, NY). 1997, Vol 30, Num 2, pp 81-90, issn 0028-3045Article

Solutions de tournois : Un spicilège = Tournaments solutions : a surveyLASLIER, J.-F.Mathématiques, informatique et sciences humaines. 1996, Num 133, pp 7-22, issn 0995-2314Article

On claws belonging to every tournamentXIAOYUN LU.Combinatorica (Print). 1991, Vol 11, Num 2, pp 173-179, issn 0209-9683Article