A successful concept for measuring non-planarity of graphs: the crossing number-Reference-Cited by-同舟云学术

A successful concept for measuring non-planarity of graphs: the crossing number

Published:2004-02 Issue:1-3 Volume:276 Page:331-352
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Székely László A.

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference68 articles.

1. Proofs from the Book;Aigner,1998

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

3. M. Anderson, B.R. Richter, P. Rodney, The crossing number of C6×C6, in: Proceedings of the 27th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, LA, 1996; Congr. Numer. 118 (1996) 97–107.

4. M. Anderson, B.R. Richter, P. Rodney, The crossing number of C7×C7, in: Proceedings of the 28th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 1997, Congr. Numer. 125 (1997) 97–117.

5. On the crossing number of product of cycles and graphs of order four;Beineke;J. Graph Theory,1980

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

1. Treewidth, Circle Graphs, and Circular Drawings;SIAM Journal on Discrete Mathematics;2024-03-06

2. Crossing lemma for the odd-crossing number;Computational Geometry;2023-01

3. On the Crossing Points of Circulant Graphs C(10,3);Advances in Applied Mathematics;2023

4. Crossings between non-homotopic edges;Journal of Combinatorial Theory, Series B;2022-09

5. The $$\mathbb {Z}_2$$-Genus of Kuratowski Minors;Discrete & Computational Geometry;2022-07-09