𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On sparse graphs with dense long paths

✍ Scribed by P. Erdös; R.L. Graham; E. Szemerédi

Book ID
103929803
Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
298 KB
Volume
1
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some results on graphs without long indu
Some results on graphs without long induced paths
✍ Dong, Jinquan 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 2 views

Let I(t) be the set of integers with the property that in every Pt-free connected graph G, the i-center C,(G) induces a connected subgraph. What is the minimum element of /(t)? In this paper, we prove that this minimum is [2t/3] -1 if t = 0 or Z(mod3) and is [ 2 t / 3 ] otherwise. Furthermore, as co

Long dominating cycles and paths in grap
Long dominating cycles and paths in graphs with large neighborhood unions
✍ H. J. Broersma; H. J. Veldman 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB 👁 1 views

## Abstract Let __G__ be a graph of order __n__ and define __NC(G)__ = min{|__N__(__u__) ∪ __N__(__v__)| |__uv__ ∉ __E__(__G__)}. A cycle __C__ of __G__ is called a __dominating cycle__ or __D__‐__cycle__ if __V__(__G__) ‐ __V__(__C__) is an independent set. A __D__‐__path__ is defined analogously.