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

FINDING HAMILTON CYCLES IN ROBUSTLY EXPANDING DIGRAPHS ¨ DEMETRES CHRISTOFIDES, PETER KEEVASH, DANIELA KUHN AND DERYK OSTHUS Abstract. We provide an NC algorithm for finding Hamilton cycles in directed graphs

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

Oriented trees in digraphs Louigi Addario-Berry∗ Fr´ed´eric Havet Bruce Reed

Source URL: perso.ens-lyon.fr

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

DiSparse6 : a handy way for computers to remember digraphs Michael Torpey University of St Andrews

Source URL: www-circa.mcs.st-and.ac.uk

Titles & Abstracts Prof. Matt DeVos Dr Gábor Kun Immersion for 2-regular digraphs

Source URL: kam.mff.cuni.cz

Bibliography on Deza Graphs and Digraphs References []

Source URL: www.liga.ens.fr

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

Computational Statistics & Data Analysis – 632 www.elsevier.com/locate/csda Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays

Source URL: www.cis.jhu.edu

arXiv:0802.0617v1 [math.CO] 5 FebOn the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs⋆ Elvan Ceyhan∗ & Carey E. Priebe† February 6, 2008

Source URL: www.cis.jhu.edu