BOOK-CHAPTER
Acyclic Choosability of Graphs with Small Maximum Degree
Daniel GonçalvesMickaël Montassier
Year: 2005 Lecture notes in computer science Pages: 239-248 Publisher: Springer Science+Business Media
Keywords:
Combinatorics List coloring Mathematics Degree (music) Complete coloring Edge coloring Vertex (graph theory) Graph Discrete mathematics Graph coloring Fractional coloring Graph power Line graph Physics
Metrics
7
Cited By
1.11
FWCI (Field Weighted Citation Impact)
14
Refs
0.78
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
Related Documents
JOURNAL ARTICLE
Acyclic Choosability of Graphs with Bounded Degree
Juan WangLian Ying MiaoJin Bo LiYunlong Liu
Journal: Acta Mathematica Sinica English Series Year: 2022 Vol: 38 (3)Pages: 560-570
JOURNAL ARTICLE
Weight Choosability of Graphs with Maximum Degree 4
Journal: Acta Mathematica Sinica English Series Year: 2020 Vol: 36 (6)Pages: 723-732
JOURNAL ARTICLE
Equitable coloring and equitable choosability of graphs with small maximum average degree
Journal: Discussiones Mathematicae Graph Theory Year: 2018 Vol: 38 (3)Pages: 829-829
JOURNAL ARTICLE
Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree
Journal: Discussiones Mathematicae Graph Theory Year: 2012 Vol: 33 (1)Pages: 91-91
JOURNAL ARTICLE
Total choosability of planar graphs with maximum degree 4
Journal: Discrete Applied Mathematics Year: 2010 Vol: 159 (1)Pages: 87-89