✦ LIBER ✦

On k-edge-ordered graphs

✍ Scribed by Denis Chebikin

Book ID: 108113387
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 259 KB
Volume: 281
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.09.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On k-ordered graphs

✍ Jill R. Faudree; Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda L 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

k-ordered Hamiltonian graphs

✍ Ng, Lenhard; Schultz, Michelle 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 2 views

A hamiltonian graph G of order n is k-ordered, 2 ≤ k ≤ n, if for every sequence v 1 , v 2 , . . . , v k of k distinct vertices of G, there exists a hamiltonian cycle that encounters v 1 , v 2 , . . . , v k in this order. Theorems by Dirac and Ore, presenting sufficient conditions for a graph to be h

Increasing paths in edge ordered graphs

✍ R. L. Graham; D. J. Kleitman 📂 Article 📅 1973 🏛 Springer Netherlands 🌐 English ⚖ 339 KB

On the k-edge magic graphs

✍ Alikhani, Saeid; Kocay, William; Lau, Gee-Choon; Lee, Sin-Min 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 351 KB

Minimally (k, k)-edge-connected graphs

✍ Kamal Hennayake; Hong-Jian Lai; Deying Li; Jingzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract For an integer __l__ > 1, the __l__‐edge‐connectivity of a connected graph with at least __l__ vertices is the smallest number of edges whose removal results in a graph with __l__ components. A connected graph __G__ is (__k__, __l__)‐edge‐connected if the __l__‐edge‐connectivity of __G_

On k-minimally n-edge-connected graphs

✍ Stephen B. Maurer; Peter J. Slater 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 815 KB