Utilizing graph thickness heuristics on the Earth-Moon problem

MaRDI QIDQ6539448zbMATH OpenFDO

Authors Robert D. Weaver

Publication date 14 May 2024

Published in Undergraduate Math Journal (Search for Journal in Brave)

zbMATH Keywords

chromatic numberEarth-Moon problemgraph coloringgraph thicknessheuristic algorithmsplanar graphsSageMath

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• A genetic algorithm for determining the thickness of a graph
• Thickness and colorability of geometric graphs
• Geometric graphs
• Graph colouring and its applications within cartography
• Approximating \(k\)-connected \(m\)-dominating sets

This page was built for publication: Utilizing graph thickness heuristics on the Earth-Moon problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6539448)