Author:
Bokal Drago,Czabarka Éva,Székely László A.,Vrt’o Imrich
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference32 articles.
1. Aigner, M., Ziegler, G.M.: Proofs from the Book. Springer, Berlin (2000)
2. Ann. Discrete Math.;M. Ajtai,1983
3. Alexandrov, L., Djidjev, H.: Linear algorithms for partitioning embedded graphs of bounded genus. SIAM J. Discrete Math. 9, 129–150 (1996)
4. Benzer, S.: On the topology of the genetic fine structure. Proc. Natl. Akad. Sci. USA 45, 1607–1620 (1959)
5. Bokal, D.: On the crossing number of Cartesian products with trees. J. Graph Theory 56, 287–300 (2007)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the number of edges of separated multigraphs;Journal of Graph Theory;2023-09-10
2. Problems related to graph indices in trees;Recent Trends in Combinatorics;2016
3. Crossing Numbers;Discrete Mathematics and Its Applications;2013-11-26
4. Crossing number additivity over edge cuts;European Journal of Combinatorics;2013-08