Partitioning a graph into degenerate subgraphs
Let G = (V, E) be a connected graph with maximum degree k ≥ 3 distinct from Kk+1. Given integers s ≥ 2 and p1, . . . , ps ≥ 0, G is said to be (p1, . . . , ps)-partitionable if there exists a partition of V into sets V1, . . . , Vs such that G[Vi] is pi-degenerate for i ∈ {1, . . . , s}. In this pap...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2018
|
| Online Access: | http://hdl.handle.net/10725/7591 https://doi.org/10.1016/j.ejc.2019.103015 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://www.sciencedirect.com/science/article/pii/S0195669819301167 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!