Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5902512
DOI10.1007/b93953zbMath1255.68106MaRDI QIDQ5902512
Cyril Gavoille, Nicolas Hanusse, Nicolas Bonichon
Publication date: 12 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items (4)
Linear choosability of graphs ⋮ Enumeration and limit laws for series-parallel graphs ⋮ Generating unlabeled connected cubic planar graphs uniformly at random ⋮ Acyclic improper choosability of graphs
This page was built for publication: Graph-Theoretic Concepts in Computer Science
