The Early History of the Brick Factory Problem-Reference-Cited by-同舟云学术

The Early History of the Brick Factory Problem

Published:2010-01-14 Issue:2 Volume:32 Page:41-48
ISSN:0343-6993
Container-title:The Mathematical Intelligencer
language:en
Short-container-title:Math Intelligencer

Author:

Beineke Lowell,Wilson Robin

Publisher

Springer Science and Business Media LLC

Subject

History and Philosophy of Science,General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/s00283-009-9120-4.pdf

Reference29 articles.

1. D. Bienstock and N. Dean, Bounds for rectilinear crossing numbers, J. Graph Theory 17 (1993), 333–348.

2. J. Blažek and M. Koman, A minimal problem concerning complete plane graphs, In: Theory of Graphs and Its Applications (ed. M. Fiedler), Czechoslovak Academy of Sciences (1964), 113–117.

3. Alex Brodsky, Stephane Durocher, and Ellen Gethner, The rectilinear crossing number of K 10 is 62, Electron. J. Combin. 8, No. 1 (2001), Research Paper 23, 1–30.

4. H. E. Dudeney, Perplexities, Strand Magazine 46, No. 271 (July 1913), 110; solution in Strand Magazine 46, No. 272 (August 1913), 221.

5. H. E. Dudeney, Amusements in Mathematics, Thomas Nelson and Sons (1917), Problem 251 and solution, 73, 200.

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

1. Crossing numbers of complete bipartite graphs;Procedia Computer Science;2023

2. The crossing number of Cartesian product of sunlet graph with path and complete bipartite graph;Discrete Mathematics, Algorithms and Applications;2022-11-30

3. Approximating the Bundled Crossing Number;WALCOM: Algorithms and Computation;2022

4. Convex drawings of the complete graph: topology meets geometry;Ars Mathematica Contemporanea;2021-11-09

5. Bounding the tripartite‐circle crossing number of complete tripartite graphs;Journal of Graph Theory;2021-10-25