An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. In Helmut Alt, Michel Habib, editors, STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings. Volume 2607 of Lecture Notes in Computer Science, pages 499-510, Springer, 2003. [doi]

@inproceedings{BonichonGH03,
  title = {An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation},
  author = {Nicolas Bonichon and Cyril Gavoille and Nicolas Hanusse},
  year = {2003},
  url = {http://link.springer.de/link/service/series/0558/bibs/2607/26070499.htm},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BonichonGH03},
  cites = {0},
  citedby = {0},
  pages = {499-510},
  booktitle = {STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
  editor = {Helmut Alt and Michel Habib},
  volume = {2607},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-00623-0},
}