Cycles in digraphsâ•fi a survey Page 1 Cycles in DigraphsA Survey JC Bermond UNIVERSITE
PARIS- SUD C. Thomassen ORSAY, FRANCE MATEMATISK INSTITUT. AARHUS …

Graph theory is a delightful playground for the exploration of proof techniques in discrete
mathematics, and its results have applications in many areas of the computing, social, and …

Collected in this volume are most of the important theorems and algorithms currently known
for planar graphs, together with constructive proofs for the theorems. Many of the algorithms …

A new sufficient condition for a graph to be Hamiltonian is given that does not require that
the closure of the graph should be complete, and so it is independent of the conditions given …

In this survey we have attempted to bring together most of the results and papers that deal
with toughness related to cycle structure. We begin with a brief introduction and a section on …

If G is a graph, a Hamiltonian circuit in G is a circuit which contains every vertex of G, and a
Hamiltonian path in G is a path which contains every vertex of G. So if G has order p, then a …

Generalizations of Dirac’s theorem in Hamiltonian graph theory—A survey - ScienceDirect
Skip to main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in …

Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey |
SpringerLink Skip to main content Advertisement SpringerLink Log in Menu Find a journal …

Abstract A sequence π=(d 1,…, dp) of length p is said to be graphic if there exists a graph G
with V (G)={u 1,…, up} such that the degree of ui in G is equal to di, for every i, l≤ i≤ p; and …

An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path
whose edges have distinct colours. The rainbow connection number of a connected graph …