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

XII Preface solution as efficiently as possible. Most of the problems we treat have a good
algorithmic solution, but we also show how even difficult problems can be treated (for …

A combinatorial Gray code for a class of objects is a listing that contains each object from the
class exactly once such that any two consecutive objects in the list differ only by asmall …

This article is intended as a survey, updating earlier surveys in the area. For completeness
of the presentation of both particular questions and the general area, it also contains …

This is intended as a survey article covering recent developments in the area of hamiltonian
graphs, that is, graphs containing a spanning cycle. This article also contains some material …

A graph is supereulerian if it has a spanning eulerian subgraph. There is a rduction method
to determine whether a graph is supereulerian, and it can also be applied to study other …

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 …

Not every 2-tough graph is Hamiltonian - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Help Search My account Sign in View PDF Download full issue …

This is the first full-length book on the major theme of symmetry in graphs. Forming part of
algebraic graph theory, this fast-growing field is concerned with the study of highly …

Princeton University Page 1 Princeton University The Complexity of the Hamiltonian Circuit
Problem for Maximal Planar Graphs Avi Wigderson Electrical Engineering and Computer …