✦ LIBER ✦

Can a Graph Have Distinct Regular Partitions?

✍ Scribed by Alon, Noga; Shapira, Asaf; Stav, Uri

Book ID: 118197001
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 203 KB
Volume: 23
Category: Article
ISSN: 0895-4801
DOI: 10.1137/070695952

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An equitable partition for a distance-re

An equitable partition for a distance-regular graph of negative type

✍ Štefko Miklavič 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 164 KB

On the number of distinct minimal clique

On the number of distinct minimal clique partitions and clique covers of a line graph

✍ Sean McGuinness; Rolf Rees 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 812 KB

Let G be a line graph. Orlin determined the clique covering and clique partition numbers cc(G) and cp(G). We obtain a constructive proof of Orlin's result and in doing so we are able to completely enumerate the number of distinct minimal clique covers and partitions of G, in terms of easily calculab

Do chemical graphs have a natural order?

Do chemical graphs have a natural order? some regularities of a “compacted maximal adjacency code”

✍ E.C. Kirby 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 972 KB

45,X/46,X, + r(X) can have a distinct ph

45,X/46,X, + r(X) can have a distinct phenotype different from Ullrich-Turner syndrome

✍ Grompe, M. ;Rao, N. ;Elder, F. F. B. ;Caskey, C. T. ;Greenberg, F. 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 512 KB