✦ LIBER ✦

Edge degrees and dominating cycles

✍ Scribed by Kiyoshi Yoshimoto

Book ID: 108113832
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 200 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.05.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-dominating cycles in graphs

✍ Shinya Fujita; Akira Saito; Tomoki Yamashita 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 181 KB

Cycles and paths in edge-colored graphs

Cycles and paths in edge-colored graphs with given degrees

✍ A. Abouelaoualim,; K. Ch. Das; W. Fernandez de la Vega; M. Karpinski; Y. Manouss 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 203 KB 👁 1 views

## Abstract Sufficient degree conditions for the existence of properly edge‐colored cycles and paths in edge‐colored graphs, multigraphs and random graphs are investigated. In particular, we prove that an edge‐colored multigraph of order __n__ on at least three colors and with minimum colored degre

Degree sums, connectivity and dominating

Degree sums, connectivity and dominating cycles in graphs

✍ Sun Zhiren; Tian Feng; Wei Bing 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 63 KB

Degree Sums, Connectivity and Dominating

Degree Sums, Connectivity and Dominating Cycles in Graphs

✍ Zhiren Sun; Feng Tian; Bing Wei 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 124 KB

Independent dominating sets and hamilton

Independent dominating sets and hamiltonian cycles

✍ Penny Haxell; Ben Seamone; Jacques Verstraete 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB

## Abstract A graph is uniquely hamiltonian if it contains exactly one hamiltonian cycle. In this note we prove that there are no __r__‐regular uniquely hamiltonian graphs when __r__ > 22. This improves upon earlier results of Thomassen. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 233–244, 20

Degree sums for edges and cycle lengths

Degree sums for edges and cycle lengths in graphs

✍ Brandt, Stephan; Veldman, Henk Jan 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 71 KB 👁 3 views

Let G be a graph of order n satisfying d(u) + d(v) ≥ n for every edge uv of G. We show that the circumference-the length of a longest cycle-of G can be expressed in terms of a certain graph parameter, and can be computed in polynomial time. Moreover, we show that G contains cycles of every length be