The theory of directed graphs has developed enormously over recent decades, yet this book
(first published in 2000) remains the only book to cover more than a small fraction of the …

We survey some recent results on long-standing conjectures regarding Hamilton cycles in
directed graphs, oriented graphs and tournaments. We also combine some of these to prove …

It is shown that, for ϵ> 0 and n> n0 (ϵ), any complete graph K on n vertices whose edges
are colored so that no vertex is incident with more than (1‐1/\sqrt2‐ϵ) n edges of the same …

Recently, Huang (1995) gave a characterization of local tournaments. His characterization
involves arc-reversals and therefore may not be easily used to solve other structural …

A (di) graph is supereulerian if it contains a spanning eulerian sub (di) graph. This property
is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by …

The problem of finding necessary and sufficient conditions for a semicomplete multipartite
digraph (SMD) to be Hamiltonian, seems to be both very interesting and difficult. Bang …

In Bang-Jensen et al.(Sufficient conditions for a digraph to be Hamiltonian, J. Graph Theory
22 (1996) 181–187) the following extension of Meyniels theorem was conjectured: If D is a …

We prove two sufficient conditions for Hamiltonian cycles in balanced bipartite digraphs. Let
D be a strongly connected balanced bipartite digraph of order 2 a. Then:(i) If a≥ 4 and max …

A Degree Sum Condition for Hamiltonicity in Balanced Bipartite Digraphs | Graphs and
Combinatorics Skip to main content SpringerLink Account Menu Find a journal Publish with us …

We describe a new type of sufficient condition for a balanced bipartite digraph to be
hamiltonian. Let D be a balanced bipartite digraph and x,y be distinct vertices in D. {x,y\} …