Randomly coloring planar graphs with fewer colors than the maximum degree

Keyphrases

• Mixing Time 100%
• Planar Graph 100%
• Maximum Degree 100%
• Adjacency Matrix 50%
• Recent Advances 50%
• Markov Chain 50%
• K-coloring 50%
• Glauber Dynamics 50%
• Randomly Sampling 50%
• Polynomial Upper Bounds 50%
• Local Uniformity 50%
• Maximum Eigenvalue 50%
• Graph Coloring 50%

Mathematics

• Maximum Degree 100%
• Planar Graph 100%
• Eigenvalue 50%
• Adjacency Matrix 50%
• Polynomial 50%
• Main Result 50%
• Upper Bound 50%
• Markov Chain 50%

Computer Science

• Planar Graph 100%
• Eigenvalue 50%
• Markov Chain 50%
• Adjacency Matrix 50%