𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Perfect pairs of trees in graphs

✍ Scribed by Ladislav Novak; Alan Gibbons

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
392 KB
Volume
20
Category
Article
ISSN
0098-9886

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Superperfect pairs of trees in graphs
Superperfect pairs of trees in graphs
✍ Ladislav A. Novak; Alan Gibbons πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 414 KB
Even Pairs in Claw-Free Perfect Graphs
Even Pairs in Claw-Free Perfect Graphs
✍ ClΓ‘udia Linhares Sales; FrΓ©dΓ©ric Maffray πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 424 KB

An even pair in a graph is a pair of non-adjacent vertices such that every chordless path between them has even length. A graph is called strict quasi-parity when every induced subgraph that is not a clique has an even pair, and it is called perfectly contractile when every induced subgraph can be t

A generalization of perfect graphs?i-per
A generalization of perfect graphs?i-perfect graphs
✍ Cai, Leizhen; Corneil, Derek πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 1003 KB

Let i be a positive integer. We generalize the chromatic number x ( G ) of G and the clique number w(G) of G as follows: The i-chromatic number of G , denoted by x Z ( G ) , is the least number k for which G has a vertex partition V,, V,, . . . , Vk: such that the clique number of the subgraph induc

Multicolored trees in complete graphs
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