Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring (Q6154191)
From MaRDI portal
scientific article; zbMATH DE number 7820557
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring |
scientific article; zbMATH DE number 7820557 |
Statements
Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring (English)
0 references
19 March 2024
0 references
coloring
0 references
induced subgraph
0 references
algorithm
0 references
path
0 references
0 references
