JOURNAL ARTICLE
List coloring triangle‐free planar graphs
Year: 2019 Journal: Journal of Graph Theory Vol: 94 (2)Pages: 278-298 Publisher: Wiley
Abstract
Abstract This paper proves the following result. Assume is a triangle‐free planar graph, is an independent set of . If is a list assignment of such that for each vertex and for each vertex , then is ‐colorable.
Keywords:
Combinatorics Mathematics Planar graph Vertex (graph theory) List coloring Planar straight-line graph Planar Outerplanar graph Graph Discrete mathematics 1-planar graph Chordal graph Pathwidth Computer science Line graph Graph power
Metrics
1
Cited By
0.21
FWCI (Field Weighted Citation Impact)
10
Refs
0.56
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Computational Geometry and Mesh Generation
Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design
Related Documents
JOURNAL ARTICLE
Fast 3-coloring Triangle-Free Planar Graphs
Journal: Algorithmica Year: 2009 Vol: 58 (3)Pages: 770-789
JOURNAL ARTICLE
Backbone coloring for triangle-free planar graphs
Journal: Acta Mathematicae Applicatae Sinica English Series Year: 2017 Vol: 33 (3)Pages: 819-824
JOURNAL ARTICLE
Fractional Coloring of Triangle-Free Planar Graphs
Zdenĕk DvořákJean‐Sébastien SereniJan Volec
Journal: The Electronic Journal of Combinatorics Year: 2015 Vol: 22 (4)
BOOK-CHAPTER
Fast 3-Coloring Triangle-Free Planar Graphs
Lecture notes in computer science Year: 2004 Pages: 436-447
JOURNAL ARTICLE
Acyclic Edge Coloring of Triangle‐Free Planar Graphs
Manu BasavarajuL. Sunil Chandran
Journal: Journal of Graph Theory Year: 2011 Vol: 71 (4)Pages: 365-385