✦ LIBER ✦

Heavy fans, cycles and paths in weighted graphs of large connectivity

✍ Scribed by Jun Fujisawa

Book ID: 108113679
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 301 KB
Volume: 307
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.04.036

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Fan Type Condition For Heavy Cycles in

A Fan Type Condition For Heavy Cycles in Weighted Graphs

✍ Shenggui Zhang; Hajo Broersma; Xueliang Li; Ligong Wang 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 111 KB

Long paths and large cycles in finite gr

Long paths and large cycles in finite graphs

✍ Hikoe Enomoto 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 503 KB

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

Heavy cycles passing through some specif

Heavy cycles passing through some specified vertices in weighted graphs

✍ Jun Fujisawa; Kiyoshi Yoshimoto; Shenggui Zhang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

## Abstract A weighted graph is one in which every edge __e__ is assigned a nonnegative number, called the weight of __e__. The sum of the weights of the edges incident with a vertex υ is called the weighted degree of υ. The weight of a cycle is defined as the sum of the weights of its edges. In th

Heavy cycles and spanning trees with few

Heavy cycles and spanning trees with few leaves in weighted graphs

✍ Binlong Li; Shenggui Zhang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Let G be a 2-connected weighted graph and k ≥ 2 an integer. In this note we prove that if the sum of the weighted degrees of every k + 1 pairwise nonadjacent vertices is at least m, then G contains either a cycle of weight at least 2m/(k + 1) or a spanning tree with no more than k leaves.

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