Building a maximal independent set for the vertex-coloring problem on planar graphs (Q2133444): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A sufficient condition for planar graphs to be 3-colorable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4633818 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The NP-completeness column: an ongoing guide / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Planar graphs: Theory and algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The four-colour theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 3-Colouring AT-Free Graphs in Polynomial Time / rank | |||
Normal rank | |||
Latest revision as of 20:02, 28 July 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
