Další formáty:
BibTeX
LaTeX
RIS
@proceedings{759244, author = {Hliněný, Petr}, booktitle = {6th Slovenian International Conference on Graph Theory}, keywords = {graph; crossing number; crossing-critical}, language = {eng}, isbn = {978-961-212-198-3}, title = {New almost-planar crossing-critical graph families}, url = {http://conferences.imfm.si/internalPage.py?pageId=8&confId=2}, year = {2007} }
TY - CONF ID - 759244 AU - Hliněný, Petr PY - 2007 TI - New almost-planar crossing-critical graph families SN - 9789612121983 KW - graph KW - crossing number KW - crossing-critical UR - http://conferences.imfm.si/internalPage.py?pageId=8&confId=2 N2 - 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 $5$ in crossing-critical graphs remains open. Furthermore, our 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[4,6-\frac8{k+1}\big)$. ER -
HLINĚNÝ, Petr. New almost-planar crossing-critical graph families. In \textit{6th Slovenian International Conference on Graph Theory}. 2007. ISBN~978-961-212-198-3.
|