Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7209416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning sparse graphs into an independent set and a graph with bounded size components |
scientific article; zbMATH DE number 7209416 |
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
0.8995322585105896
0 references
0.8918840289115906
0 references
0.8858082294464111
0 references
0.8523727655410767
0 references
0.8139508962631226
0 references
