Building a Maximal Independent Set for the Vertex-coloring Problem on Planar Graphs
Open Access
- 24 November 2020
- journal article
- Published by Elsevier BV in Electronic Notes in Theoretical Computer Science
- Vol. 354, 75-89
- https://doi.org/10.1016/j.entcs.2020.10.007
Abstract
No abstract availableKeywords
Funding Information
- SNI-CONACyT
This publication has 6 references indexed in Scilit:
- Planar graphs without cycles of length from 4 to 7 are 3-colorableJournal of Combinatorial Theory, Series B, 2005
- A sufficient condition for planar graphs to be 3-colorableJournal of Combinatorial Theory, Series B, 2003
- The Four-Colour TheoremJournal of Combinatorial Theory, Series B, 1997
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Über eine Eigenschaft der ebenen KomplexeMathematische Annalen, 1937
- Sur le problème des courbes gauches en TopologieFundamenta Mathematicae, 1930