3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles (original) (raw)

Note on 3-choosability of planar graphs with maximum degree 4

Roman Soták

Discrete Mathematics

View PDFchevron_right

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

Andre Raspaud

Discrete Mathematics, 2010

View PDFchevron_right

(3, 1)*-CHOOSABILITY of Planar Graphs Without Adjacent Short Cycles

André Raspaud

Electronic Notes in Discrete Mathematics, 2013

View PDFchevron_right

A note on the acyclic 3-choosability of some planar graphs

Andre Raspaud

Discrete Applied Mathematics, 2010

View PDFchevron_right

On the 3-colorability of planar graphs without 4-, 7- and 9-cycles

André Raspaud

Discrete Mathematics, 2009

View PDFchevron_right

Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable

André Raspaud

Journal of Combinatorial Theory, Series B, 2009

View PDFchevron_right

Planar graphs without adjacent cycles of length at most seven are 3-colorable

Andre Raspaud

Discrete Mathematics, 2010

View PDFchevron_right

A sufficient condition for planar graphs to be 3-colorable

André Raspaud

Journal of Combinatorial Theory, 2003

View PDFchevron_right

On -choosability of planar graphs without adjacent short cycles

Andre Raspaud

Discrete Applied Mathematics, 2014

View PDFchevron_right

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

André Raspaud

Journal of Combinatorial Theory, 2005

View PDFchevron_right

Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable

herve hocquard

Information Processing Letters, 2009

View PDFchevron_right

Some structural properties of planar graphs and their applications to 3-choosability

Andre Raspaud

Discrete Mathematics, 2012

View PDFchevron_right

On acyclic 4-choosability of planar graphs without short cycles

André Raspaud

Discrete Mathematics, 2010

View PDFchevron_right

Multiple list colouring triangle-free planar graphs

Yiting Kelly Jiang

arXiv (Cornell University), 2018

View PDFchevron_right

Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles

André Raspaud

Discrete Mathematics, 2010

View PDFchevron_right

Choosability of planar graphs of girth 5

Ken-ichi Kawarabayashi

2011

View PDFchevron_right

Choosability with separation of planar graphs without prescribed cycles

Wai Shiu

Applied Mathematics and Computation, 2020

View PDFchevron_right

On the Three Colorability of Planar Graphs

Ibrahim Cahit

View PDFchevron_right

Acyclic 4-choosability of planar graphs

André Raspaud

Discrete Mathematics, 2011

View PDFchevron_right

A sufficient condition for planar graphs to be acyclically 5-choosable

Andre Raspaud

Journal of Graph Theory, 2012

View PDFchevron_right

Acyclic 4-choosability of planar graphs without adjacent short cycles

Anna Ivanova

Discrete Mathematics, 2012

View PDFchevron_right

Acyclic 4-colorability of planar graphs without cycles of length 4 or 6

André Raspaud

Journal of Applied and Industrial Mathematics, 2010

View PDFchevron_right

Acyclic choosability of planar graphs: a Steinberg like approach

herve hocquard

Electronic Notes in Discrete Mathematics, 2009

View PDFchevron_right

Acyclic 5-choosability of planar graphs without 4-cycles

Andre Raspaud

Discrete Mathematics, 2008

View PDFchevron_right

Three-coloring triangle-free planar graphs in linear time

Ken-ichi Kawarabayashi

ACM Transactions on Algorithms, 2011

View PDFchevron_right

Acyclic 5-choosability of planar graphs without small cycles

André Raspaud

Journal of Graph Theory, 2007

View PDFchevron_right

Bordeaux 3-color conjecture and 3-choosability

André Raspaud

Discrete Mathematics, 2006

View PDFchevron_right

Planar graphs with girth at least 5 are (3,5)-colorable

André Raspaud

Discrete Mathematics, 2015

View PDFchevron_right

Structural properties and edge choosability of planar graphs without 4-cycles

wenjie He

Discrete Mathematics, 2008

View PDFchevron_right

Path Choosability of Planar Graphs

Glenn G Chappell

The Electronic Journal of Combinatorics, 2018

View PDFchevron_right

A Class of Three-Colorable Triangle-Free Graphs

Marko R Radovanović

Journal of Graph Theory, 2012

View PDFchevron_right

Thresholds for Path Colorings of Planar Graphs

John Gimbel

Algorithms and Combinatorics

View PDFchevron_right