✦ LIBER ✦

Primal graphs with small degrees

✍ Scribed by Phyllis Z. Chinn; R.Bruce Richter; Miroslaw Truszczynski

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 746 KB
Volume: 87
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90133-m

No coin nor oath required. For personal study only.

✦ Synopsis

It has previously

been shown that there is a unique set Il of primal graphs such that every graph has an edge-decomposition into non-isomorphic elements of 17 and that the only decomposition of an element of II into non-isomorphic elements of II is the obvious one. Here it is shown that there are infinitely many elements of II even among graphs having a relatively simple structure.

On the other hand, within this same class of graphs, we show that 'most' of them are not primal.

📜 SIMILAR VOLUMES

Sizes of Critical Graphs with Small Maxi

Sizes of Critical Graphs with Small Maximum Degrees

✍ Xuechao Li 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 136 KB

Small Universal Graphs for Bounded-Degre

Small Universal Graphs for Bounded-Degree Planar Graphs

✍ Michael Capalbo 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 265 KB

Graphs with constant link and small degr

Graphs with constant link and small degree or order

✍ J. I. Hall 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 957 KB

The graph G has constant link L if for each vertex x of. G the graph induced by G on the, vertices adjacent to x is isomorphic to L. For each graph L on 6 or fewer vertices w e decide whether or not there exists a graph G with constant link L. From this w e are able to list all graphs on 11 or fewer

Superconnected and Hyperconnected Small

Superconnected and Hyperconnected Small Degree Transitive Graphs

✍ Yingzhi Tian; Jixiang Meng 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 228 KB

Graphs with degrees from prescribed inte

Graphs with degrees from prescribed intervals

✍ Michael Koren 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 979 KB

Necessary 2nd sufficient corMions from presaibed intervals, are giw~ for the existence degrees

Graphs with unavoidable subgraphs with l

Graphs with unavoidable subgraphs with large degrees

✍ L. Caccetta; P. Erdös; K. Vijayan 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 360 KB

Let %(n, rn) denote the class of simple graphs on n vertices and rn edges and let G E %(n, rn). There are many results in graph theory giving conditions under which G contains certain types of subgraphs, such as cycles of given lengths, complete graphs, etc. For example, Turan's theorem gives a suff