Work

Projective‐Planar Graphs with no K3, 4‐Minor. II

Year: 2016

Type: article

Abstract: The authors previously published an iterative process to generate a class of projective‐planar K3, 4‐free graphs called “patch graphs.” They also showed that any simple, almost 4‐connected, nonplanar, and projective‐planar graph that is K3, 4‐free is a subgraph of a patch graph. In this article, we describe a simpler and more natural class of cubic K3, 4‐free projective‐planar graphs that we call Möbius hyperladders. Furthermore, every simple, almost 4‐connected, nonplanar, and projective‐planar graph that is K3, 4‐free is a minor of a Möbius hyperladder. As applications of these structures we determine the page number of patch graphs and of Möbius hyperladders.

Source: Journal of Graph Theory

DOI: 10.1002/jgt.22113

Authors: John Maharry, Daniel Slilaty

Institutions: The Ohio State University, Wright State University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Simons Foundation

Award: G433433951