Name
Abstract | ||
|---|---|---|
A graph G of order n is called arbitrarily partitionable (AP, for short) if, for every sequence (n1,…,nk) of positive integers with n1+…+nk=n, there exists a partition (V1,…,Vk) of the vertex set V(G) such that Vi induces a connected subgraph of order ni, for i=1,…,k. In this paper we consider the on-line version of this notion, defined in a natural way. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.dam.2017.04.006 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Partitions of graphs,Traceable graph,Erdős–Gallai condition,Ore condition,Perfect matching | Random regular graph,Discrete mathematics,Combinatorics,Bound graph,Forbidden graph characterization,Graph power,Distance-hereditary graph,Factor-critical graph,Universal graph,Mathematics,Pancyclic graph | Journal |
Volume | ISSN | Citations |
226 | 0166-218X | 1 |
PageRank | References | Authors |
0.35 | 10 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafał Kalinowski | 1 | 48 | 10.75 |