Building a maximal independent set for the vertex-coloring problem on planar graphs (Q2133444): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.entcs.2020.10.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3110101364 / rank | |||
Normal rank | |||
Revision as of 19:11, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Building a maximal independent set for the vertex-coloring problem on planar graphs |
scientific article |
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
