𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Consistent Cycles in Graphs and Digraphs

✍ Scribed by Štefko Miklavič; Primož Potočnik; Steve Wilson

Book ID
106047640
Publisher
Springer Japan
Year
2007
Tongue
English
Weight
121 KB
Volume
23
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycle extendability in graphs and digrap
Cycle extendability in graphs and digraphs
✍ LeRoy B. Beasley; David E. Brown 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 201 KB

In 1990, Hendry conjectured that all chordal Hamiltonian graphs are cycle extendable, that is, the vertices of each non-Hamiltonian cycle are contained in a cycle of length one greater. Let A be a symmetric (0,1)-matrix with zero main diagonal such that A is the adjacency matrix of a chordal Hamilto

Cycle packings in graphs and digraphs
Cycle packings in graphs and digraphs
✍ Jennifer J. Quinn 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 196 KB

A cycle packing in a (directed) multigraph is a vertex disjoint collection of (directed) elementary cycles. If D is a demiregular multidigraph we show that the arcs of D can be partitioned into Ai. cycle packings --where Ain is the maximum indegree of a vertex in D. We then show that the maximum len

Hamiltonian cycles and paths in Cayley g
Hamiltonian cycles and paths in Cayley graphs and digraphs — A survey
✍ Stephen J. Curran; Joseph A. Gallian 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 927 KB

Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced

Disjoint Cycles in Eulerian Digraphs and
Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs
✍ Richard A. Brualdi; Jian Shen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 87 KB

denote the set of all m × n {0, 1}-matrices with row sum vector R and column sum vector S. Suppose A(R, S) ] ". The interchange graph G(R, S) of A(R, S) was defined by Brualdi in 1980. It is the graph with all matrices in A(R, S) as its vertices and two matrices are adjacent provided they differ by

Cycles in dense digraphs
Cycles in dense digraphs
✍ Maria Chudnovsky; Paul Seymour; Blair Sullivan 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 347 KB