Pairs of forbidden subgraphs and 2-connected supereulerian graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F18%3A43953267" target="_blank" >RIV/49777513:23520/18:43953267 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/abs/pii/S0012365X18300803" target="_blank" >https://www.sciencedirect.com/science/article/abs/pii/S0012365X18300803</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2018.03.009" target="_blank" >10.1016/j.disc.2018.03.009</a>
Alternative languages
Result language
angličtina
Original language name
Pairs of forbidden subgraphs and 2-connected supereulerian graphs
Original language description
It is proved that a 2-connected claw-free graph admits a spanning Eulerian subgraph if it is N_{1,1,4} or N_{1,2,2} or Z_5 or P_8-free. Related hamiltonicity results are also obtained.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
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
2018
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
DISCRETE MATHEMATICS
ISSN
0012-365X
e-ISSN
—
Volume of the periodical
341
Issue of the periodical within the volume
6
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
12
Pages from-to
1696-1707
UT code for WoS article
000431162700018
EID of the result in the Scopus database
—