Work

Five-coloring graphs on the Klein bottle

Year: 2012

Type: preprint

Abstract: We exhibit an explicit list of nine graphs such that a graph drawn in the Klein bottle is 5-colorable if and only if it has no subgraph isomorphic to a member of the list.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1201.5361

Authors: Chenette, Nathan, Postle, Luke, Streib, Noah, Thomas, Robin, Yerger, Carl

Institution: Georgia Institute of Technology

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: National Science Foundation

Awards: Characterization and Recognition of Perfect Graphs, Graph Structure, Coloring, Flows and Algorithms, FRG: Collaborative Research: The Four-Color Theorem and Beyond

OpenAlex ID: W2953222437

Cites: 19

Cited by:

Related to: 20