✦ LIBER ✦

Perfect graph decompositions

✍ Scribed by Zsolt Tuza

Publisher: Springer Japan
Year: 1991
Tongue: English
Weight: 291 KB
Volume: 7
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01789465

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On perfect Γ-decompositions of the compl

On perfect Γ-decompositions of the complete graph

✍ Marco Buratti; Anita Pasotti 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract Generalizing the well‐known concept of an __i__‐perfect cycle system, Pasotti [Pasotti, in press, Australas J Combin] defined a Γ‐decomposition (Γ‐factorization) of a complete graph __K__~__v__~ to be __i‐perfect__ if for every edge [__x__, __y__] of __K__~__v__~ there is exactly one bl

A decomposition for strongly perfect gra

A decomposition for strongly perfect graphs

✍ Stephan Olariu 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 554 KB

A graph G is strongly perfect if every induced subgraph H of G contains a stable set that meets all the maximal cliques of H . We present a graph decomposition that preserves strong perfection: more precisely, a stitch decomposition of a graph G = (V, €1 is a partition of V into nonempty disjoint su

Graph decompositions without isolates

✍ Nathan Linial 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 546 KB

Low diameter graph decompositions

✍ Nathan Linial; Michael Saks 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 916 KB

Sparsity-certifying Graph Decompositions

✍ Ileana Streinu; Louis Theran 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 467 KB

Graph Decompositions without Isolated Ve

Graph Decompositions without Isolated Vertices

✍ H. Enomoto 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 405 KB

We prove the following conjecture of A. Frank (Fifth British Combinatorial Conference, Aberdeen, Scotland, 1975): Let \(G\) be a connected simple graph of order \(n\), and \(n=n_{1}+\cdots+n_{k}\) be a partition of \(n\) with \(n_{i} \geqslant 2\). Suppose that the minimum degree of \(G\) is at leas