Every planar graph with nine points has a nonplanar complement
From MaRDI portal
Cites work
Cited in
(32)- Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
- On the thickness of graphs of given degree
- Edge-disjoint maximal planar graphs
- A tribute to Frank Harary (in honor of his 70th birthday)
- Note on \(k\)-planar crossing numbers
- Complete colorings of planar graphs
- The complement of a nIL graph with thirteen vertices is IL
- Thickness of the subgroup intersection graph of a finite group
- A short proof of the non-biplanarity of \(K_9\)
- On polyhedral graphs and their complements
- Hadwiger numbers of self-complementary graphs
- On the 2-colored crossing number
- -chromatic partition in planar graph characterization
- Matroids Determine the Embeddability of Graphs in Surfaces
- Bi-embeddings of graphs
- Most graphs are knotted
- The complement problem for linklessly embeddable graphs
- A short proof of the non-biplanarity of $K_9$
- Recent results in topological graph theory
- On the bigenus of the complete graphs
- Index 3 biembeddings of the complete graphs
- Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant
- Complete minors in complements of nonseparating planar graphs
- On graph thickness, geometric thickness, and separator theorems
- On the biplanarity of blowups
- The thickness of some complete bipartite and tripartite graphs
- Intrinsically knotted graphs and connected domination
- Geometric thickness of multigraphs is \(\exists \mathbb{R}\)-complete
- On the biplanar and k-planar crossing numbers
- The thickness of a graph with constraint on girth
- Planar-toroidal decomposition of \(K_{12}\)
- Infinite families of bi-embeddings
This page was built for publication: Every planar graph with nine points has a nonplanar complement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5721708)
