✦ LIBER ✦

Large Monotone Paths in Graphs with Bounded Degree

✍ Scribed by Raphael Yuster

Publisher: Springer Japan
Year: 2001
Tongue: English
Weight: 109 KB
Volume: 17
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730170031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Large P4-free graphs with bounded degree

✍ Myung S. Chung; Douglas B. West 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 424 KB

## Abstract Let __ex__ \* (__D__; __H__) denote the maximum number of edges in a connected graph with maximum degree __D__ and no induced subgraph isomorphic to __H.__ We prove that this is finite only when __H__ is a disjoint union of paths,m in which case we provide crude upper and lower bounds.

Large 2P3-free graphs with bounded degre

Large 2P3-free graphs with bounded degree

✍ Myung S. Chung; Douglas B. West 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Let ex\*(D;H) be the maximum number of edges in a connected graph with maximum degree D and no induced subgraph H; this is finite if and only if H is a disjoint union of paths. If the largest component of such an H has order m, then ex\*(D;H) = O(D2ex\*(D;Pm)). Constructively, ex\*(D;qPm) = O(qD2ex\

Cycles and paths in graphs with large mi

Cycles and paths in graphs with large minimal degree

✍ V. Nikiforov; R. H. Schelp 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 1 views

## Abstract Let __G__ be a simple graph of order __n__ and minimal degree > cn (0 < c < 1/2). We prove that (1) There exist __n__~0~ = __n__~0~(__c__) and __k__ = __k__(__c__) such that if __n__ > __n__~0~ and __G__ contains a cycle __C__~__t__~ for some __t__ > 2__k__, then __G__ contains a cycle

Longest Paths and Longest Cycles in Grap

Longest Paths and Longest Cycles in Graphs with Large Degree Sums

✍ Ingo Schiermeyer; Meike Tewes 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 139 KB

Relative length of long paths and cycles

Relative length of long paths and cycles in graphs with large degree sums

✍ Hikoe Enomoto; Jan van den Heuvel; Atsushi Kaneko; Akira Saito 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 601 KB

## Abstract For a graph __G, p__(__G__) denotes the order of a longest path in __G__ and __c__(__G__) the order of a longest cycle. We show that if __G__ is a connected graph __n__ ≥ 3 vertices such that __d__(__u__) + __d__(__v__) + __d__(__w__) ≧ n for all triples __u, v, w__ of independent verti

Induced-Universal Graphs for Graphs with

Induced-Universal Graphs for Graphs with Bounded Maximum Degree

✍ Steve Butler 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 213 KB