Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10188794" target="_blank" >RIV/00216208:11320/13:10188794 - isvavai.cz</a>
Alternative codes found
RIV/49777513:23520/13:43922109
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-45043-3_12" target="_blank" >http://dx.doi.org/10.1007/978-3-642-45043-3_12</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-45043-3_12" target="_blank" >10.1007/978-3-642-45043-3_12</a>
Alternative languages
Result language
angličtina
Original language name
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Original language description
We relate the existence of hamiltonian structures of interval graphs to the scattering number.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2013
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-Theoretic Concepts in Computer Science
ISBN
978-3-642-45042-6
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
127-138
Publisher name
Springer
Place of publication
Berlin
Event location
Lübeck, Germany
Event date
Jun 19, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—