^2-homology and planar graphs
From MaRDI portal
Publication:2839283
Abstract: In his 1930 paper, Kuratowksi categorized planar graphs, proving that a finite graph is planar if and only if it does not contain a subgraph that is homeomorphic to , the complete graph on 5 vertices, or , the complete bipartite graph on six vertices. In their 2001 paper, Davis and Okun point out that the graph can be understood as the nerve of a right-angled Coxeter system and prove that this graph is not planar using results from -homology. In this paper, we employ a similar method proving is not planar.
Recommendations
- scientific article; zbMATH DE number 4105739
- Publication:4945331
- Graph homology and graph configuration spaces
- Homology of planar polygon spaces
- Graphs on surfaces and Khovanov homology
- An algorithm for an 𝓁2-homological test for the planarity of a graph
- Homology theory of graphs
- On chromatic symmetric homology and planarity of graphs
- Homologies of complexes of doubly connected graphs
- On the second homology of planar graph braid groups
Cited in
(3)
This page was built for publication: \(\ell ^{2}\)-homology and planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2839283)