Coloring Planar Graphs is a theoretical framework in graph theory that specifies the rules and bounds for assigning colors to the vertices of planar graphs such that no adjacent vertices share the same color, distinguished by its reliance on the topological constraints inherent to planar embeddings.
603
Publications
26K
Citations
787
Authors
424
Institutions
Publications per year
2017–2026
51
Parents
Publications
603
Choice Reviews Online · 1995 · 1.3K citations
Noga Alon, Raphael Yuster, Uri Zwick · Journal of the ACM · 1995 · 1K citations · Full text
Davide Costa, Alain Hertz · Journal of the Operational Research Society · 1997 · 501 citations
1–5 of 603
Authors
787
- OV
23
h-index
- ARAndré Raspaud
Laboratoire Bordelais de Recherche en Informatique, France
18 publications · 892 citations
16
h-index
- RŠ
15
h-index
- GL
13
h-index
- JW
13
h-index
1–5 of 787
Institutions
424
Shandong University
Jinan, China
20 h-index
86 publications
2.4K citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
19 h-index
50 publications
1.9K citations
Université de Bordeaux
Bordeaux, France
19 h-index
52 publications
2K citations
Sobolev Institute of Mathematics
Novosibirsk, Russia
18 h-index
29 publications
1.2K citations
Zhejiang Normal University
Jinhua, China
18 h-index
78 publications
1.7K citations
Institut Polytechnique de Bordeaux
Bordeaux, France
18 h-index
38 publications
1.6K citations
Charles University
Prague, Czechia
17 h-index
34 publications
893 citations
Centre National de la Recherche Scientifique
Paris, France
16 h-index
42 publications
1.1K citations
1–8 of 424
Venues
- Discrete Mathematics
91 publications · 3.4K citations
31
h-index
- Journal of Graph Theory
57 publications · 2.4K citations
27
h-index
- Journal of Combinatorial Theory Series B
41 publications · 1.8K citations
24
h-index
- Discrete Applied Mathematics
42 publications · 1.5K citations
22
h-index
- Information Processing Letters
29 publications · 931 citations
18
h-index
1–5