Graphs without a 3-connected subgraph are 4-colorable (Q6521084)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs without a 3-connected subgraph are 4-colorable |
scientific article from arXiv |
Statements
Graphs without a 3-connected subgraph are 4-colorable (English)
0 references
