Abstract
We show that, for all choices of integers $k>2$ and $m$, there are simple $3$-connected $k$-crossing-critical graphs containing more than $m$ vertices of each even degree $\leq2k-2$. This construction answers one half of a question raised by Bokal, while the other half asking analogously about vertices of odd degrees at least $7$ in crossing-critical graphs remains open. Furthermore, our newly constructed graphs have several other interesting properties; for instance, they are almost planar and their average degree can attain any rational value in the interval $\big[3+{1\over5},6-{8\over k+1}\big)$.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Book embedding of infinite family of almost-planar crossing-critical graphs;THE 2ND INTERNATIONAL CONFERENCE ON NATURAL SCIENCES, MATHEMATICS, APPLICATIONS, RESEARCH, AND TECHNOLOGY (ICON-SMART 2021): Materials Science and Bioinformatics for Medical, Food, and Marine Industries;2023
2. On Degree Properties of Crossing-Critical Families of Graphs;Lecture Notes in Computer Science;2015
3. Crossing Numbers;Discrete Mathematics and Its Applications;2013-11-26
4. Stars and bonds in crossing-critical graphs;Journal of Graph Theory;2010-11
5. Crossing-critical graphs with large maximum degree;Journal of Combinatorial Theory, Series B;2010-07