3-choosability of triangle-free planar graphs with constraints on 4-cycles

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10051758" target="_blank" >RIV/00216208:11320/10:10051758 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

3-choosability of triangle-free planar graphs with constraints on 4-cycles

Original language description

We prove that if a triangle-free planar graph is not 3-choosable, then it contains a 4-cycle that intersects another 4- or 5-cycle in exactly one edge. This strengthens Thomassen's result [C. Thomassen, J. Combin. Theory Ser. B, 64 (1995), pp. 101-107] that every planar graph of girth at least 5 is 3-choosable.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

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)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

SIAM Journal on Discrete Mathematics

ISSN

0895-4801

e-ISSN

—

Volume of the periodical

24

Issue of the periodical within the volume

3

Country of publishing house

US - UNITED STATES

Number of pages

12

Pages from-to

—

UT code for WoS article

000282291600015

EID of the result in the Scopus database

—