✦ LIBER ✦

On a conjecture of bondy

✍ Scribed by I Fournier; P Fraisse

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 412 KB
Volume: 39
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(85)90035-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pancyclic graphs and a conjecture of Bon

Pancyclic graphs and a conjecture of Bondy and Chvátal

✍ E.F Schmeichel; S.L Hakimi 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 618 KB

A Proof of a Conjecture of Bondy Concern

A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs

✍ B. Bollobás; A.D. Scott 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Our aim in this note is to prove a conjecture of Bondy, extending a classical theorem of Dirac to edge-weighted digraphs: if every vertex has out-weight at least 1 then the digraph contains a path of weight at least 1. We also give several related conjectures and results concerning heavy cycles in e

A generalization of the Bondy-Chvátal th

A generalization of the Bondy-Chvátal theorem on the k-closure

✍ Zhu Yong-jin; Tian Feng 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 368 KB

Counting subgraphs a new approach to the

Counting subgraphs a new approach to the Caccetta-Häggkvist conjecture

✍ J.A. Bondy 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 552 KB

On a Conjecture of Chalk

✍ Ping Ding 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Let f # Z[x] with degree k and let p be a prime. By a complete trigonometric sum we mean a sum of the form S(q, f )= q x=1 e q ( f (x)), where q is a positive integer and e q (:)=exp(2?if (x)Âq). Professor Chalk made a conjecture on the upper bound of S(q, f ) when q is a prime power. We prove Chalk

On a Conjecture of Woodall

✍ Hao Li 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Dirac proved in 1952 that every 2-connected graph of order n and minimum degree k admits a cycle of length at least minfn; 2kg: As a possible improvement, Woodall conjectured in 1975 that if a 2-connected graph of order n has at least n 2 þ k vertices of degree at least k; then it has a cycle of len