Every planar graph with nine points has a nonplanar complement

DOI10.1090/S0002-9904-1962-10850-7zbMath0114.14602OpenAlexW2023894060MaRDI QIDQ5721708

J. Battle, Yukihiro Kodama, Frank Harary

Publication date: 1962

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9904-1962-10850-7

zbMATH Keywords

topology

Related Items

The complement problem for linklessly embeddable graphs ⋮ Thickness of the subgroup intersection graph of a finite group ⋮ A short proof of the non-biplanarity of \(K_9\) ⋮ On the bigenus of the complete graphs ⋮ A short proof of the non-biplanarity of $K_9$ ⋮ Edge-disjoint maximal planar graphs ⋮ On polyhedral graphs and their complements ⋮ Hadwiger numbers of self-complementary graphs ⋮ Recent results in topological graph theory ⋮ A tribute to Frank Harary (in honor of his 70th birthday) ⋮ Index 3 biembeddings of the complete graphs ⋮ On graph thickness, geometric thickness, and separator theorems ⋮ Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant ⋮ Complete minors in complements of nonseparating planar graphs ⋮ Note on \(k\)-planar crossing numbers ⋮ On the 2-colored crossing number ⋮ Infinite families of bi-embeddings ⋮ On the thickness of graphs of given degree ⋮ Complete colorings of planar graphs ⋮ γ-Chromatic Partition in Planar Graph Characterization ⋮ Bi-embeddings of graphs ⋮ The complement of a nIL graph with thirteen vertices is IL ⋮ Most graphs are knotted ⋮ Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs ⋮ Matroids Determine the Embeddability of Graphs in Surfaces

Cites Work

• Unnamed Item
• A remark on the existence of finite graphs
• A Complementary Problem on Nonplanar Graphs

This page was built for publication: Every planar graph with nine points has a nonplanar complement