On Degree Properties of Crossing-critical Families of Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F15%3A00080985" target="_blank" >RIV/00216224:14330/15:00080985 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-27261-0_7" target="_blank" >http://dx.doi.org/10.1007/978-3-319-27261-0_7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-27261-0_7" target="_blank" >10.1007/978-3-319-27261-0_7</a>
Alternative languages
Result language
angličtina
Original language name
On Degree Properties of Crossing-critical Families of Graphs
Original language description
Answering an open question from 2007, we construct infinite k-crossing-critical families of graphs which contain vertices of any prescribed odd degree, for sufficiently large k. From this we derive that, for any set of integers D such that min(D)>=3 and 3,4eD, and for all sufficiently large k there exists a k-crossing-critical family such that the numbers in D are precisely the vertex degrees which occur arbitrarily often in any large enough graph in this family. We also investigate what are the possible average degrees of such crossing-critical families.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA14-03501S" target="_blank" >GA14-03501S: Parameterized algorithms and kernelization in the context of discrete mathematics and logic</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2015
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
Article name in the collection
Graph Drawing and Network Visualization 2015, Lecture Notes in Computer Science 9411
ISBN
9783319272603
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
75-86
Publisher name
Springer Verlag
Place of publication
Berlin
Event location
Los Angeles
Event date
Jan 1, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—