Results 51 to 60 of about 105 (77)
, 2010 A king in a directed graph is a vertex from which each vertex in the graph can be reached through paths of length at most two. There is a broad literature on tournaments (completely oriented digraphs), and it has been known for more than half a century ...
Watanabe, Osamu +5 more
core +1 more source
Classificação dos digrafos semicompletos hamiltonianos [PDF]
, 2018 Orientador: Claudina Izepe RodriguesDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação CientificaResumo: 0 objetivo principal deste trabalho é apresentar uma classificação para os dígrafos ...
Carvalho, Marcelo Dantas de
core
Arc pancyclicity in multipartite tournaments GTECS – an application in crystallography
, 2014 This thesis consists of two parts where the first one represents theoretical results in the field of arc-pancyclicity and connectivity in multipartite tournaments and the second part presents the graph theoretical ideas and algorithms behind the ...
Grüter, Steffen
core
Rainbow directed version of Dirac's theorem
International audienceLet G={Gi : 1≤i ≤s} be a collection of not necessarily distinct graphs on the same vertex set V. A graph H is called rainbow in G if any two edges of H belong to different graphs of G .
Li, Xueliang +3 more
core +1 more source
, 2018 Le but principal de cette thèse est de présenter des conditions suffisantes pour garantir l'existence de subdivisions dans les graphes dirigés. Bien que ce genre de questions soit assez bien maitrisé dans le cas des graphes non orientés, très peu de ...
Lochet, William
core
Bounding the chromatic number of dense digraphs by arc neighborhoods
The chromatic number of a directed graph is the minimum number of induced acyclic subdigraphs that cover its vertex set, and accordingly, the chromatic number of a tournament is the minimum number of transitive subtournaments that cover its vertex set ...
Klingelhoefer, Felix, Newman, Alantha
core
, 2006 A king in a directed graph is a node from which each node in the graph can be reached via paths of length at most two. There is a broad literature on tournaments (completely oriented digraphs), and it has been known for more than half a century that all ...
Osamu Watanabe +2 more
core
Springer Monographs in Mathematics, 2018 This edited volume offers a detailed account on the theory of directed graphs from the perspective of important classes of digraphs, with each chapter written by experts on the topic. Outlining fundamental discoveries and new results obtained over recent
Gutin, Gregory, Bang-Jensen, Jørgen
exaly +4 more sources
Locally semicomplete digraphs: A generalization of tournaments
Journal of Graph Theory, 1990 In this paper we introduce a new class of directed graphs called locally semicomplete digraphs. These are defined to be those digraphs for which the following holds: for every vertex x the vertices dominated by x induce a semicomplete digraph and the ...
Jørgen Bang-Jensen
exaly +2 more sources