plantri
Fast generation of planar graphs. The program Plantri is described. Its principles of operation, the basis for its efficiency and the recursive algorithms behind many of its capabilities are shown. Plantri is the fastest isomorphism-free generator of many classes of planar graphs, including triangulations, quadrangulations and convex polytopes. Many applications in the natural sciences as well as in mathematics are presented. In addition, many counts of isomorphism classes of planar graphs compiled using Plantri are given. These include triangulations, quadrangulations, convex polytopes, several classes of cubic and quartic graphs and triangulations of disks.
Keywords for this software
References in zbMATH (referenced in 67 articles )
Showing results 1 to 20 of 67.
Sorted by year (- Brinkmann, Gunnar; Van Cleemput, Nico: 4-connected polyhedra have at least a linear number of Hamiltonian cycles (2021)
- Darda, Ratko; Milanič, Martin; Pizaña, Miguel: Searching for square-complementary graphs: complexity of recognition and further nonexistence results (2021)
- Goedgebeur, Jan; Meersman, Barbara; Zamfirescu, Carol T.: Graphs with few Hamiltonian cycles (2020)
- Goedgebeur, Jan; Neyt, Addie; Zamfirescu, Carol T.: Structural and computational results on platypus graphs (2020)
- Goetschalckx, Pieter; Coolsaet, Kris; Van Cleemput, Nico: Generation of local symmetry-preserving operations on polyhedra (2020)
- Klocker, Benedikt; Fleischner, Herbert; Raidl, Günther R.: A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (2020)
- Labbé, Jean-Philippe; Rote, Günter; Ziegler, Günter Matthias: Area difference bounds for dissections of a square into an odd number of triangles (2020)
- Montejano, Luis; Pauli, Eric; Raggi, Miguel; Roldán-Pensado, Edgardo: The graphs behind reuleaux polyhedra (2020)
- Abrishami, Gholamreza; Rahbarnia, Freydoon: A note on the smallest connected non-traceable cubic bipartite planar graph (2019)
- Brinkmann, Gunnar; Ozeki, Kenta; Van Cleemput, Nico: Types of triangle in Hamiltonian triangulations and an application to domination and (k)-walks (2019)
- Brinkmann, G.; Zamfirescu, C. T.: Polyhedra with few 3-cuts are Hamiltonian (2019)
- Ghebleh, Mohammad; Kanso, Ali; Stevanovic, Dragan: Graph6Java: a researcher-friendly Java framework for testing conjectures in chemical graph theory (2019)
- Pivotto, Irene; Royle, Gordon: Highly-connected planar cubic graphs with few or many Hamilton cycles (2019)
- Dowden, Chris; Kang, Mihyun; Sprüssel, Philipp: The evolution of random graphs on surfaces (2018)
- Erokhovets, Nikolai: Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face (2018)
- Kang, Mihyun; Sprüssel, Philipp: Symmetries of unlabelled planar triangulations (2018)
- Tilley, James: Kempe-locking configurations (2018)
- Tuzun, Robert E.; Sikora, Adam S.: Verification of the Jones unknot conjecture up to 22 crossings (2018)
- Van Cleemput, Nicolas; Zamfirescu, Carol T.: Regular non-Hamiltonian polyhedral graphs (2018)
- Dowden, Chris; Kang, Mihyun; Sprüssel, Philipp: The evolution of random graphs on surfaces (2017)