Nonderogatory unicyclic digraphs.
Bravo, Diego, Rada, Juan (2007)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “On a conjecture of quintas and arc-traceability in upset tournaments”
Nonderogatory unicyclic digraphs.
On a certain class of multidigraphs, for which reversal of no arc decreases the number of their cycles
Jozef Jirásek (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Short score certificates for upset tournaments.
Poet, Jeffrey, Shader, Bryan L. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs.
Chwe, Byoung-Song (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Hamiltonian virus-free digraphs.
Ordaz, Oscar, González, Leida, Márquez, Isabel, Quiroz, Domingo (2000)
Divulgaciones Matemáticas
Similarity:
Randomly hamiltonian digraphs
G. Chartrand, H. Kronk, Don Lick (1969)
Fundamenta Mathematicae
Similarity:
-favouring Eulerian trails in digraphs
Herbert Fleischner, Emanuel Wenger (1989)
Archivum Mathematicum
Similarity:
On the complete digraphs which are simply disconnected.
Davide C. Demaria, José Carlos de Souza Kiihl (1991)
Publicacions Matemàtiques
Similarity:
Homotopic methods are employed for the characterization of the complete digraphs which are the composition of non-trivial highly regular tournaments.