| Title: | Decomposing planar cubic graphs |
| Authors: | Hoffmann-Ostenhof, Arthur Kaiser, Tomáš Ozeki, Kenta |
| Citation: | HOFFMANN-OSTENHOF, A., KAISER, T., OZEKI, K. Decomposing planar cubic graphs. Journal of Graph Theory, 2018, roč. 88, č. 4, s. 631-640. ISSN 0364-9024. |
| Issue Date: | 2018 |
| Publisher: | Wiley |
| Document type: | článek article |
| URI: | 2-s2.0-85040370976 http://hdl.handle.net/11025/35699 |
| ISSN: | 0364-9024 |
| Keywords in different language: | cubic graph;decomposition;3-regular graph;separating cycle;spanning tree |
| Abstract in different language: | 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. |
| Rights: | Plný text není přístupný. © Wiley |
| Appears in Collections: | Články / Articles (NTIS) Články / Articles (KMA) OBD |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| Hoffmann-Ostenhof_et_al-2018-Journal_of_Graph_Theory.pdf | 266,65 kB | Adobe PDF | View/Open Request a copy |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/35699Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.