Results 41 to 50 of about 105 (77)
, 2020 summary:We examine various types of $\mathcal F$-hypercyclic ($\mathcal F$-topologically transitive) and disjoint $\mathcal F$-hypercyclic (disjoint $\mathcal F$-topologically transitive) properties of binary relations over topological spaces.
Kostić, Marko
core +1 more source
Algorithms for Promise Coloring Problems on Tournaments and Graphs
, 2023 La première partie de cette thèse porte sur le sujet de la coloration de tournois,sous l’angle de l’algorithmie, de la complexité et de la structure. Une k-colorationd’un graphe orienté, et en particulier d’un tournoi, est une partition de ses sommetsen ...
Klingelhoefer, Félix
core
Null Models of Economic Networks: The Case of the World Trade Web [PDF]
In all empirical-network studies, the observed properties of economic networks are informative only if compared with a well-defined null model that can quantitatively predict the behavior of such properties in constrained graphs.
Giorgio Fagiolo +2 more
core
Cycle Extendability in Graphs and Digraphs
, 2011 In 1990, Hendry conjectured that all chordal Hamiltonian graphs are cycle extendable, that is, the vertices of each non-Hamiltonian cycle are contained in a cycle of length one greater.
Beasley, LeRoy B., Brown, David E.
core +1 more source
A well-quasi-order for tournaments
, 2009 A digraph H is immersed in a digraph G if the vertices of H are mapped to (distinct) vertices of G, and the edges of H are mapped to directed paths joining the corresponding pairs of vertices of G, in such a way that the paths are pairwise edge-disjoint.
Paul Seymour, Maria Chudnovsky
core
Minors and planar embeddings of digraphs
, 2004 Embedding graphs in surfaces is the central concept of topological graph theory. Classifying embeddability of graphs is motivated by Kuratowski’s Theorem and Robertson-Seymour theory, which confirms that the set of obstructions to embeddability in an ...
Sneddon, Jamie David
core
Kings in generalized tournaments.
, 2018 iv, 58 leaves: illustrations.Includes bibliographical references: leaves 57.This thesis explores how to find and construct kings in three generalizations of tourna- ment: semi-complete digraphs, oriented graphs and quasi-transitive oriented graphs.In ...
Zhang, Cheng
core
Extremal problems on graphs, directed graphs and hypergraphs
, 2016 This thesis is concerned with extremal problems on graphs and similar structures. We first study degree conditions in uniform hypergraphs that force matchings of various sizes.
Townsend, Timothy Duncan
core
Ramsey numbers for tournaments
, 2001 The Ramsey number r(D1,…,Dk) of acyclic directed graphs D1,…,Dk is defined as the largest integer r for which there exists a tournament T=(V,A) on r vertices with a k-coloring ϕ:A→{1,…,k} of the arc set A such that no Di occurs in color i for any i∈{1 ...
Tuza, Zsolt +3 more
core +1 more source
Cycle Extendability in Graphs, Bigraphs and Digraphs
, 2011 In 1990, Hendry conjectured that all chordal Hamiltonian graphs are cycle extendable, that is, the vertices of each non-Hamiltonian cycle are contained in a cycle of length one greater.
Thomas, Brent +2 more
core