✦ LIBER ✦

Partitioning a graph into defensivek-alliances

✍ Scribed by Ismael G. Yero; Sergio Bermudo; Juan A. Rodríguez-Velázquez; José M. Sigarreta

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2010
Tongue: English
Weight: 230 KB
Volume: 27
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-011-9075-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning a graph into two isomorphic

Partitioning a graph into two isomorphic pieces

✍ Anthony Bonato; Richard Nowakowski 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

## Abstract A simple graph __G__ has the neighbour‐closed‐co‐neighbour property, or ncc property, if for all vertices __x__ of __G__, the subgraph induced by the set of neighbours of __x__ is isomorphic to the subgraph induced by the set of non‐neighbours of __x__. We present characterizations of g

Partitioning graphs into Hamiltonian one

Partitioning graphs into Hamiltonian ones

✍ Lin Chen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 851 KB

Partition of a bipartite graph into cycl

Partition of a bipartite graph into cycles

✍ Hong Wang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Wang, H., Partition of bipartite graph into cycles, Discrete Mathematics 117 (1993) 287-291. El-Zahar (1984) conjectured that if G is a graph on n, + n, + + nk vertices with ni > 3 for 1s i < k and minimum degree 6(G)>rn,/21+rn2/21+ ... +rn,/21, then G contains k vertex-disjoint cycles of lengths n,

Partitioning a graph into the minimal nu

Partitioning a graph into the minimal number of complete subgraphs

✍ A. P. Ryzhkov 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 557 KB

On partitions of graphs into trees

✍ F.R.K. Chung 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 934 KB

We crgnsider the minimum m\*-nber T(G) of subsets intl:, which the edge set E(G) of a graph G can lx partitioned so that each subset forms a tree. It is shown that for any connected (3 with II vertices, we always have T( Gj s [$I.

Partitioning random graphs into large cy

Partitioning random graphs into large cycles

✍ A.M. Frieze 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 833 KB

Let r 3 1 be a tied positive integer. We give the limiting distribution for the probability that the vertices of a random graph can be partitioned equitably into I cycles.