Building a maximal independent set for the vertex-coloring problem on planar graphs (Q2133444)
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 7516361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Building a maximal independent set for the vertex-coloring problem on planar graphs |
scientific article; zbMATH DE number 7516361 |
Statements
Building a maximal independent set for the vertex-coloring problem on planar graphs (English)
0 references
29 April 2022
0 references
planar graphs
0 references
vertex coloring
0 references
wheel graphs
0 references
polyhedral wheel graphs
0 references
maximal independent set
0 references
