𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimal decompositions of graphs into mutually isomorphic subgraphs

✍ Scribed by F. R. K. Chung; P. Erdős; R. L. Graham

Book ID
110564225
Publisher
Springer-Verlag
Year
1981
Tongue
English
Weight
401 KB
Volume
1
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spanning subgraphs of graphs partitioned
Spanning subgraphs of graphs partitioned into two isomorphic pieces
✍ Anthony Bonato 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract A graph has the neighbor‐closed‐co‐neighbor, or ncc property, if for each of its vertices __x__, the subgraph induced by the neighbor set of __x__ is isomorphic to the subgraph induced by the closed non‐neighbor set of __x__. As proved by Bonato and Nowakowski [5], graphs with the ncc p

Graphs isomorphic to subgraphs of their
Graphs isomorphic to subgraphs of their line-graphs
✍ Douglas Bauer; Ralph Tindell 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 621 KB

## An emhdding of graph G into graph N is by definition an isomorphism OI G onto a subgraph of H. It is shown in this paper that every unicycle V embeds in its line-graph L(V), and that every other connected graph that embeds in its own line-graph may be constructed from such an embedded unicycle

Sharp bounds for decompositions of graph
Sharp bounds for decompositions of graphs into completer-partite subgraphs
✍ Gregory, David A.; Vander Meulen, Kevin N. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 435 KB 👁 2 views

If G is a graph on n vertices and r 2 2, w e let m,(G) denote the minimum number of complete multipartite subgraphs, with r or fewer parts, needed to partition the edge set, f(G). In determining m,(G), w e may assume that no two vertices of G have the same neighbor set. For such reduced graphs G, w