A quick way to verify if a graph is 3-colorable (Q6633531)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A quick way to verify if a graph is 3-colorable |
scientific article; zbMATH DE number 7939384
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A quick way to verify if a graph is 3-colorable |
scientific article; zbMATH DE number 7939384 |
Statements
A quick way to verify if a graph is 3-colorable (English)
0 references
6 November 2024
0 references
proper coloring of a graph
0 references
chromatic number
0 references
nonseparable graph
0 references
0 references
0 references
0 references
