Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning sparse graphs into an independent set and a graph with bounded size components |
scientific article |
Statements
Partitioning sparse graphs into an independent set and a graph with bounded size components (English)
0 references
8 June 2020
0 references
planar graphs
0 references
vertex partition
0 references
bounded component
0 references
discharging method
0 references
improper coloring
0 references
islands
0 references
