✦ LIBER ✦

The symmetric (2k, k)-graphs

✍ Scribed by Matthias Kriesell

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 166 KB
Volume: 36
Category: Article
ISSN: 0364-9024
DOI: 10.1002/1097-0118(200101)36:1<35::aid-jgt4>3.0.co;2-j

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Clique-inverse graphs of K3-free and K4-

Clique-inverse graphs of K3-free and K4-free graphs

✍ Fábio Protti; Jayme L. Szwarcfiter 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB

Symmetric graph designs on friendship gr

Symmetric graph designs on friendship graphs

✍ Dalibor Fronc̆ek; Alexander Rosa 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

graph designs on friendship graphs.

Game chromatic index of k-degenerate gra

Game chromatic index of k-degenerate graphs

✍ Leizhen Cai; Xuding Zhu 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

k-Bounded classes of dominant-independen

k-Bounded classes of dominant-independent perfect graphs

✍ Zverovich, Igor E. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 253 KB 👁 2 views

Let α(G), γ(G), and i(G) be the independence number, the domination number, and the independent domination number of a graph G, respectively. For any k ≥ 0, we define the following hereditary classes: αi where ISub(G) is the set of all induced subgraphs of a graph G. In this article, we present a f