✦ LIBER ✦

Double independence and tree pairs in graphs

✍ Scribed by Novak, Ladislav A.; Gibbons, Alan

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 671 KB
Volume: 24
Category: Article
ISSN: 0098-9886
DOI: 10.1002/(sici)1097-007x(199611/12)24:6<657::aid-cta946>3.0.co;2-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perfect pairs of trees in graphs

✍ Ladislav Novak; Alan Gibbons 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 392 KB

Superperfect pairs of trees in graphs

✍ Ladislav A. Novak; Alan Gibbons 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 414 KB

Independence and hamiltonicity in 3-domi

Independence and hamiltonicity in 3-domination-critical graphs

✍ Favaron, Odile; Tian, Feng; Zhang, Lei 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 3 views

Let δ, γ, i and α be respectively the minimum degree, the domination number, the independent domination number and the independence number of a graph G. The graph G is 3-γ-critical if γ = 3 and the addition of any edge decreases γ by 1. It was conjectured that any connected 3-γ-critical graph satisf

Rainbow trees in graphs and generalized

Rainbow trees in graphs and generalized connectivity

✍ Gary Chartrand; Futaba Okamoto; Ping Zhang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB

Projectivity and independent sets in pow

Projectivity and independent sets in powers of graphs

✍ Benoit Larose; Claude Tardif 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 1 views

## Abstract We investigate the relationship between projectivity and the structure of maximal independent sets in powers of circular graphs, Kneser graphs and truncated simplices. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 162–171, 2002

Triangles and Neighbourhoods of Independ

Triangles and Neighbourhoods of Independent Sets in Graphs

✍ Andrew M. Robertshaw; Douglas R. Woodall 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 124 KB

It is proved that a graph of order n contains a triangle if |N(X )| > 1 3 (n+|X |) for every independent set X of vertices. This bound is sharp.