Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleynʼs technique-Reference-Cited by-同舟云学术

Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleynʼs technique

Published:2013-05 Issue:4 Volume:120 Page:777-794
ISSN:0097-3165
Container-title:Journal of Combinatorial Theory, Series A
language:en
Short-container-title:Journal of Combinatorial Theory, Series A

Author:

Sharir Micha,Sheffer Adam,Welzl Emo

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference27 articles.

1. On the number of plane geometric graphs;Aichholzer;Graphs Combin.,2007

2. Crossing-free subgraphs;Ajtai;Ann. Discrete Math.,1982

3. A lower bound on the maximum number of crossing-free Hamilton cycles in a rectilinear drawing of Kn;Akl;Ars Combin.,1979

4. On the number of cycles in planar graphs;Buchin,2007

5. A. Dumitrescu, A. Schulz, A. Sheffer, Cs.D. Tóth, Bounds on the maximum multiplicity of some common geometric graphs, in: Proc. 28th Symp. Theoret. Aspects Comput. Sci., 2011, pp. 637–648.

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time;Algorithmica;2024-07-18

2. An Upper Bound for the Number of Rectangulations of a Planar Point Set;The Electronic Journal of Combinatorics;2024-01-26

3. Area Optimal Polygonization Using Simulated Annealing;ACM Journal of Experimental Algorithmics;2022-03-04

4. Area-Optimal Simple Polygonalizations: The CG Challenge 2019;ACM Journal of Experimental Algorithmics;2022-03-04

5. Circumscribing Polygons and Polygonizations for Disjoint Line Segments;Discrete & Computational Geometry;2022-01-31