ARBITRARY ORIENTATIONS OF HAMILTON CYCLES IN DIGRAPHS ¨ LOUIS DEBIASIO, DANIELA KUHN, THEODORE MOLLA, DERYK OSTHUS AND AMELIA TAYLOR Abstract. Let n be sufficiently large and suppose that G is a digraph on n vertices wh

Source URL: web.mat.bham.ac.uk

Digraphs Methods for digraphs Version 0.5 Jan De Beule Julius Jonušas

Source URL: www.gap-system.org

• Graph theory
• Graph connectivity
• Directed graph
• Digraph
• Reachability
• Path
• Graph
• Vertex
• Gh

Digraph Measures: Kelly Decompositions, Games, and Orderings Paul Hunter Computer Laboratory, University of Cambridge, Cambridge CB3 0FD, UK.

Source URL: logic.las.tu-berlin.de

On the chromatic number of digraphs Ararat Harutyunyan (University of Oxford) The dichromatic number of a digraph D is the smallest k such that the vertex set of D can be partitioned into k sets each of which induces an

Source URL: web.mat.bham.ac.uk

arXiv:0802.0638v1 [stat.ME] 5 FebThe Use of Domination Number of a Random Proximity Catch Digraph for Testing Spatial Patterns of Segregation and Association⋆ Elvan Ceyhan & Carey E. Priebe

Source URL: www.cis.jhu.edu

CORRIGENDUM TO “THE MAXIMAL SPECTRAL RADIUS OF A DIGRAPH WITH (M + 1)2 − S EDGES” JAN SNELLMAN∗ Abstract. In [3] we claimed to have proved the following: given any fixed integer s > 6 it holds that for all suffic

Source URL: www.math.technion.ac.il

Ranking the vertices of a paired comparison Digraph.dvi

Source URL: gorogoro.cis.ibaraki.ac.jp

Introduction Universal structures Surreal numbers & Hypnagogic digraph

Source URL: jdh.hamkins.org

Ranking the vertices of an r-partite paired comparison digraph Mikio Kano Department of Mathematics, Akashi Technological College, Uozumi, Akashi 674, Japan Abstract

Source URL: gorogoro.cis.ibaraki.ac.jp

Arbitrary orientations of Hamilton cycles in digraphs Amelia Taylor (University of Birmingham) Let n be sufficiently large and suppose that G is a digraph on n vertices where every vertex has in- and outdegree at least n

Source URL: web.mat.bham.ac.uk