Crossing-critical graphs with large maximum degree
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10033303" target="_blank" >RIV/00216208:11320/10:10033303 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Crossing-critical graphs with large maximum degree
Original language description
A conjecture of Richter and Salazar about graphs that are critical for a fixed crossing number k is that they have bounded bandwidth. A weaker well-known conjecture of Richter is that their maximum degree is bounded in terms of k. In this note we disprove these conjectures for every kgreater-or-equal, slanted171, by providing examples of k-crossing-critical graphs with arbitrarily large maximum degree.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Combinatorial Theory. Series B
ISSN
0095-8956
e-ISSN
—
Volume of the periodical
100
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
5
Pages from-to
—
UT code for WoS article
000277254700006
EID of the result in the Scopus database
—