A Heuristic for the Coloring of Planar Graphs
Open Access
- 24 November 2020
- journal article
- Published by Elsevier BV in Electronic Notes in Theoretical Computer Science
- Vol. 354, 91-105
- https://doi.org/10.1016/j.entcs.2020.10.008
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Chain hexagonal cacti: Matchings and independent setsDiscrete Mathematics, 2010
- A simple algorithm for 4-coloring 3-colorable planar graphsTheoretical Computer Science, 2010
- Extremal Hosoya index and Merrifield–Simmons index of hexagonal spidersDiscrete Applied Mathematics, 2008
- The Four-Colour TheoremJournal of Combinatorial Theory, Series B, 1997
- Efficient Vertex- and Edge-Coloring of Outerplanar GraphsSIAM Journal on Algebraic Discrete Methods, 1986
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 1977
- Every planar map is four colorable. Part II: ReducibilityIllinois Journal of Mathematics, 1977
- A Dual form of Kuratowski's TheoremCanadian Mathematical Bulletin, 1965
- Sur le problème des courbes gauches en TopologieFundamenta Mathematicae, 1930