✦ LIBER ✦

Superperfect pairs of trees in graphs

✍ Scribed by Ladislav A. Novak; Alan Gibbons

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 414 KB
Volume: 21
Category: Article
ISSN: 0098-9886
DOI: 10.1002/cta.4490210207

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

Double independence and tree pairs in gr

Double independence and tree pairs in graphs

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

Multicolored trees in complete graphs

✍ S. Akbari; A. Alipour 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

## Abstract A multicolored tree is a tree whose edges have different colors. Brualdi and Hollingsworth 5 proved in any proper edge coloring of the complete graph __K__~2__n__~(__n__ > 2) with 2__n__ − 1 colors, there are two edge‐disjoint multicolored spanning trees. In this paper we generalize thi

Multicolored Trees in Complete Graphs

✍ Richard A. Brualdi; Susan Hollingsworth 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 180 KB

We prove the existence of two edge-disjoint multicolored spanning trees in any edge-coloring of a complete graph by perfect matchings; we conjecture that a full partition into multicolored spanning trees is always possible.

Paired-domination in graphs

✍ Haynes, Teresa W.; Slater, Peter J. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 3 views

In a graph G Å (V, E) if we think of each vertex s as the possible location for a guard capable of protecting each vertex in its closed neighborhood N[s], then ''domination'' requires every vertex to be protected. Thus, S ʚ V (G) is a dominating set if ʜ s √ S N[s] Å V (G). For total domination, eac

Decompositions of graphs into trees

✍ Zbigniew Lonc 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 460 KB