The Non-Biplanar Character of the Complete 9-Graph
From MaRDI portal
Publication:5720699
DOI10.4153/CMB-1963-026-xzbMath0113.38803MaRDI QIDQ5720699
Publication date: 1963
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
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$, Current graphs and bi-embeddings, 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, Complete minors in complements of nonseparating planar graphs, Note on \(k\)-planar crossing numbers, On the 2-colored crossing number, On the thickness of graphs of given degree, Complete colorings of planar graphs, Bi-embeddings of graphs, The thickness and chromatic number of \(r\)-inflated graphs, Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
