Decomposing planar cubic graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F18%3A43956055" target="_blank" >RIV/49777513:23520/18:43956055 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1002/jgt.22234" target="_blank" >http://dx.doi.org/10.1002/jgt.22234</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.22234" target="_blank" >10.1002/jgt.22234</a>
Alternative languages
Result language
angličtina
Original language name
Decomposing planar cubic graphs
Original language description
The 3‐Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2‐regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.
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
<a href="/en/project/GA14-19503S" target="_blank" >GA14-19503S: Graph coloring and structure</a><br>
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
Journal of Graph Theory
ISSN
0364-9024
e-ISSN
—
Volume of the periodical
88
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
10
Pages from-to
631-640
UT code for WoS article
000435277000007
EID of the result in the Scopus database
2-s2.0-85040370976