A Set of Topological Invariants for Graphs
From MaRDI portal
Cited in
(8)- Graph isomorphism problem
- Lie algebras and the four color theorem
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace
- Fullerenes and disk-fullerenes
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Hitting minors on bounded treewidth graphs. I: General upper bounds
- Infinite-ended groups with planar Cayley graphs
- Graph polynomials: some questions on the edge
This page was built for publication: A Set of Topological Invariants for Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4752591)