Short score certificates for upset tournaments.
Poet, Jeffrey, Shader, Bryan L. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Poet, Jeffrey, Shader, Bryan L. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jesús Alva-Samos, Juan José Montellano-Ballesteros (2017)
Discussiones Mathematicae Graph Theory
Similarity:
An arc-coloured digraph D = (V,A) is said to be rainbow connected if for every pair {u, v} ⊆ V there is a directed uv-path all whose arcs have different colours and a directed vu-path all whose arcs have different colours. The minimum number of colours required to make the digraph D rainbow connected is called the rainbow connection number of D, denoted rc⃗ (D). A cactus is a digraph where each arc belongs to exactly one directed cycle. In this paper we give sharp upper and lower bounds...
Lim, Chjan C., Van Patten, Gregory K. (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Arthur, David (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Herbert Fleischner, Emanuel Wenger (1989)
Archivum Mathematicum
Similarity:
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.
Jozef Jirásek (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Coolsaet, K., Sticker, H. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chwe, Byoung-Song (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Hortensia Galeana-Sánchez, Guadalupe Gaytán-Gómez, Rocío Rojas-Monroy (2016)
Discussiones Mathematicae Graph Theory
Similarity:
We call a digraph D an m-colored digraph if the arcs of D are colored with m colors. A directed path (or a directed cycle) is called monochromatic if all of its arcs are colored alike. A subdigraph H in D is called rainbow if all of its arcs have different colors. A set N ⊆ V (D) is said to be a kernel by monochromatic paths of D if it satisfies the two following conditions: for every pair of different vertices u, v ∈ N there is no monochromatic path in D between them, and for every...