New proofs of the uniqueness of extremal noneven digraphs.
Lim, Chjan C., Van Patten, Gregory K. (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “-favouring Eulerian trails in digraphs”
New proofs of the uniqueness of extremal noneven digraphs.
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.
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:
Short score certificates for upset tournaments.
Poet, Jeffrey, Shader, Bryan L. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The restricted arc-width of a graph.
Arthur, David (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The arc-width of a graph.
Barát, János, Hajnal, Péter (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Digraphs maximal with respect to arc connectivity
Peter Horák (1982)
Mathematica Slovaca
Similarity:
On graphs all of whose {C₃,T₃}-free arc colorations are kernel-perfect
Hortensia Galeana-Sánchez, José de Jesús García-Ruvalcaba (2001)
Discussiones Mathematicae Graph Theory
Similarity:
A digraph D is called a kernel-perfect digraph or KP-digraph when every induced subdigraph of D has a kernel. We call the digraph D an m-coloured digraph if the arcs of D are coloured with m distinct colours. A path P is monochromatic in D if all of its arcs are coloured alike in D. The closure of D, denoted by ζ(D), is the m-coloured digraph defined as follows: V( ζ(D)) = V(D), and A( ζ(D)) = ∪_{i} {(u,v) with colour i: there exists a monochromatic...