On dominating even subgraphs in cubic graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F17%3A43932717" target="_blank" >RIV/49777513:23520/17:43932717 - isvavai.cz</a>
Result on the web
<a href="http://epubs.siam.org/doi/abs/10.1137/16M1066622" target="_blank" >http://epubs.siam.org/doi/abs/10.1137/16M1066622</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1137/16M1066622" target="_blank" >10.1137/16M1066622</a>
Alternative languages
Result language
angličtina
Original language name
On dominating even subgraphs in cubic graphs
Original language description
It is shown that a 3-edge connected cubic graph has a dominating even subgraph in which every component contains at least six vertices.
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
2017
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
SIAM JOURNAL ON DISCRETE MATHEMATICS
ISSN
0895-4801
e-ISSN
—
Volume of the periodical
31
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
18
Pages from-to
890-907
UT code for WoS article
000404770300017
EID of the result in the Scopus database
2-s2.0-85021942370