A lower bound for the optimal crossing-free Hamiltonian cycle problem-Reference-Cited by-同舟云学术

A lower bound for the optimal crossing-free Hamiltonian cycle problem

Published:1987-12 Issue:4 Volume:2 Page:327-343
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Hayward Ryan B.

Publisher

Springer Science and Business Media LLC

Subject

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

Link

http://link.springer.com/content/pdf/10.1007/BF02187887.pdf

Reference6 articles.

1. S. Akl, A lower bound on the maximum number of crossing-free Hamilton cycles in a rectilinear drawing ofK n ,Ars Combin. 7 (1979), 7–18.

2. M. Ajtai, V. Chvátal, M. Newborn, and E. Szemerédi, Crossing-free subgraphs,Ann. Discrete Math. 12 (1982), 9–12.

3. P. Erdos and R. K. Guy, Crossing number problems,Amer. Math. Monthly 80 (1973), 52–58.

4. R. K. Guy, Unsolved problems,Amer. Math. Monthly 88 (1981), 757.

5. R. B. Hayward, The Optimal Crossing-Free Hamilton Cycle Problem for Planar Drawings of the Complete Graph, M.Sc. thesis, Queen's University, Kingston, Ontario, 1982.

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

1. On asymptotic packing of geometric graphs;Discrete Applied Mathematics;2022-12

2. Reprint of: Upward planar embedding of an n -vertex oriented path onO(n2)points;Computational Geometry;2014-04

3. Upward planar embedding of an n -vertex oriented path onO(n2)points;Computational Geometry;2013-10

4. On the Number of Crossing‐Free Matchings, Cycles, and Partitions;SIAM Journal on Computing;2006-01

5. On the number of crossing-free matchings, (cycles, and partitions);Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06;2006