The k-in-a-path problem for claw-free graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10038266" target="_blank" >RIV/00216208:11320/10:10038266 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The k-in-a-path problem for claw-free graphs
Original language description
We show that the k-in-a-path problem is polynomially solvable for claw-free graphs.
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)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
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
Article name in the collection
27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010
ISBN
978-3-939897-16-3
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
—
Publisher name
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
Place of publication
Dagstuhl, Germany
Event location
Nancy, France
Event date
Mar 4, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—