𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On partitioning a graph into two connected subgraphs

✍ Scribed by Daniël Paulusma; Johan M.M. van Rooij

Book ID
113927538
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
317 KB
Volume
412
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On partitioning the edges of graphs into
On partitioning the edges of graphs into connected subgraphs
✍ M. Jünger; G. Reinelt; W. R. Pulleyblank 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 559 KB

For any positive integer s, an s-partition of a graph G = ( ! -( €I is a partition of E into El U E2 U U E k, where 14 = s for 1 I i 5 k -1 and 1 5 1 4 1 5 s and each €; induces a connected subgraph of G. We prove (i) if G is connected, then there exists a 2-partition, but not neces-(ii) if G is 2-e

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