Planar 4-critical graphs with four triangles
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10283294" target="_blank" >RIV/00216208:11320/14:10283294 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ejc.2014.03.009" target="_blank" >http://dx.doi.org/10.1016/j.ejc.2014.03.009</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2014.03.009" target="_blank" >10.1016/j.ejc.2014.03.009</a>
Alternative languages
Result language
angličtina
Original language name
Planar 4-critical graphs with four triangles
Original language description
By the Grunbaum-Aksenov Theorem (extending Grotzsch's Theorem) every planar graph with at most three triangles is 3-colorable. However, there are infinitely many planar 4-critical graphs with exactly four triangles. We describe all such graphs. This answers a question of Erdos from 1990.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
European Journal of Combinatorics
ISSN
0195-6698
e-ISSN
—
Volume of the periodical
41
Issue of the periodical within the volume
říjen
Country of publishing house
GB - UNITED KINGDOM
Number of pages
14
Pages from-to
138-151
UT code for WoS article
000338399000009
EID of the result in the Scopus database
—