✦ LIBER ✦

Distance-Dominating Cycles in Quasi Claw-Free Graphs

✍ Scribed by Chuanping Chen; Amel Harkat-Benhamdine; Hao Li

Publisher: Springer Japan
Year: 1999
Tongue: English
Weight: 90 KB
Volume: 15
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730050061

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian cycles and 2-dominating indu

Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs

✍ Jinfeng Feng 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 186 KB

Quasi-claw-free graphs

✍ A. Ainouche 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 645 KB

A graph G is quasi claw-free if it satisfies the property: This property is satisfied if in particular u does not center a claw (induced K1.3). Many known results on claw-free graphs, dealing with matching and hamiltonicity are extended to the larger class of quasi-claw-free graphs.

Hamilton cycles in claw-free graphs

✍ Cun-Quan Zhang 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB 👁 2 views

Dominating cycles in bipartite biclaw-fr

Dominating cycles in bipartite biclaw-free graphs

✍ Daniel Barraez; Evelyne Flandrin; Hao Li; Oscar Ordaz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Flandrin et ai. (to appear) define a simple bipartite graph to be biclaw-free if it contains no induced subgraph isomorphic to H, where H could be obtained from two copies of K1.3 by adding an edge joining the two vertices of degree 3. They have shown that if G is a bipartite, balanced, biclaw-free

Hamiltonian Cycles in Almost Claw-Free G

Hamiltonian Cycles in Almost Claw-Free Graphs

✍ MingChu Li 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 209 KB

Longest Cycles in Almost Claw-Free Graph

Longest Cycles in Almost Claw-Free Graphs

✍ MingChu Li 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 192 KB