Counting unrooted maps using tree-decomposition
From MaRDI portal
Publication:2654585
zbMath1207.05089arXivmath/0601123MaRDI QIDQ2654585
Publication date: 19 January 2010
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0601123
File on IPFS
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Enumeration in graph theory (05C30)
Related Items (1)
This page was built for publication: Counting unrooted maps using tree-decomposition