Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925)
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: Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable |
scientific article; zbMATH DE number 7771802
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable |
scientific article; zbMATH DE number 7771802 |
Statements
Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (English)
0 references
29 November 2023
0 references
planar graph
0 references
coloring
0 references
defective coloring
0 references
0 references
