A heuristic for the coloring of planar graphs

DOI10.1016/j.entcs.2020.10.008OpenAlexW3107256321WikidataQ113317261 ScholiaQ113317261MaRDI QIDQ2133446

Cristina López-Ramírez, Ana E. De Ita-Varela, Jorge Eduardo Gutiérrez Gómez, Guillermo de Ita Luna

Publication date: 29 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2020.10.008

zbMATH Keywords

planar graphsindependent pathsmaximal independent set3-coloring graph

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• Unnamed Item
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• Chain hexagonal cacti: matchings and independent sets
• A simple algorithm for 4-coloring 3-colorable planar graphs
• Extremal Hosoya index and Merrifield-Simmons index of hexagonal spiders
• Planar graphs: Theory and algorithms
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The four-colour theorem
• Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs
• 3-Colouring AT-Free Graphs in Polynomial Time
• Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
• The NP-completeness column: an ongoing guide
• A Dual form of Kuratowski's Theorem

This page was built for publication: A heuristic for the coloring of planar graphs