On subgraphs without large components
We consider, for a positive integer $k$, induced subgraphs in which each component has order at most $k$. Such a subgraph is said to be $k$-divided. We show that finding large induced subgraphs with this property is NP-complete. We also consider a related graph-coloring problem: how many colors are...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics of the Czech Academy of Science
2017-04-01
|
| Series: | Mathematica Bohemica |
| Subjects: | |
| Online Access: | http://mb.math.cas.cz/full/142/1/mb142_1_8.pdf |