Indexed metadata

Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable

O.V. Borodin, A.N. Glebov, A. Raspaud

Source record

Source: Crossref

Published: Oct 1, 2010

DOI: 10.1016/j.disc.2010.03.021

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable — Mathematical Frontier Network