Criteria for integer and modulo 2 embeddability of graphs to surfaces

TL;DR

This paper establishes criteria for determining when graphs can be embedded on surfaces with integer or modulo 2 conditions, advancing understanding in topological graph theory.

Contribution

It introduces new criteria for integer and modulo 2 embeddability of graphs on surfaces, filling gaps in existing topological graph theory methods.

Findings

Provided criteria for integer embeddability of graphs.

Developed criteria for modulo 2 embeddability.

Enhanced understanding of graph embeddings on surfaces.

Abstract

The study of graph drawings on 2-surfaces is an active area of mathematical research. Our main results are criteria for integer and modulo 2 embeddability of graphs to surfaces.