✦ LIBER ✦

Minimum dominating cycles in outerplanar graphs

✍ Scribed by Andrzej Proskurowski; Maciej M. Sysło

Publisher: Springer
Year: 1981
Tongue: English
Weight: 615 KB
Volume: 10
Category: Article
ISSN: 1573-7640
DOI: 10.1007/bf00977745

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding minimum dominating cycles in per

Finding minimum dominating cycles in permutation graphs

✍ Charles J Colbourn; J.Mark Keil; Lorna K Stewart 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Dominating cycles in halin graphs

✍ Mirosława Skowrońska; Maciej M. Sysło 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 676 KB

A cycle in a graph is dominating if every vertex lies at distance at most one from the cycle and a cycle is D-cycle if every edge is incident with a vertex of the cycle. In this paper, first we provide recursive formulae for finding a shortest dominating cycle in a Hahn graph; minor modifications ca

Long dominating cycles in graphs

✍ Ruqun Shen; Feng Tian 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Let G be a connected graph of order n, and let NC2(G) denote min{ [N(u) UN(v)[: In this paper, we prove that if G contains a dominating cycle and ~ ~> 2, then G contains a dominating cycle of length at least min{n,2NC2(G)-3}.

Minimum dominating cycles in 2-trees

✍ Andrzej Proskurowski 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 610 KB

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

Dominating cycles in regular 3-connected

Dominating cycles in regular 3-connected graphs

✍ Bill Jackson; Hao Li; Yongjin Zhu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 744 KB

Jackson, B., H. Li and Y. Zhu, Dominating cycles in regular 3-connected graphs, Discrete Mathematics 102 (1992) 163-176. Let G be a 3-connected, k-regular graph on at most 4k vertices. We show that, for k > 63, every longest cycle of G is a dominating cycle. We conjecture that G is in fact hamilton