Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2009.08.010 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2071241856 / rank | |||
Normal rank |
Revision as of 21:42, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Planar graphs without adjacent cycles of length at most seven are 3-colorable |
scientific article |
Statements
Planar graphs without adjacent cycles of length at most seven are 3-colorable (English)
0 references
15 December 2009
0 references
the 3-color problem
0 references