Building a maximal independent set for the vertex-coloring problem on planar graphs (Q2133444): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q113317262, #quickstatements; #temporary_batch_1707303357582 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q113317262 / rank | |||
Normal rank |
Revision as of 15:29, 7 February 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