Decomposing planar cubic graphs

Show simple item record
dc.contributor.authorHoffmann-Ostenhof, Arthur
dc.contributor.authorKaiser, Tomáš
dc.contributor.authorOzeki, Kenta
dc.date.accessioned2019-10-28T11:00:12Z
dc.date.available2019-10-28T11:00:12Z
dc.date.issued2018
dc.description.abstract-translatedThe 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.en
dc.format10 s.cs
dc.format.mimetypeapplication/pdf
dc.identifier.citationHOFFMANN-OSTENHOF, A., KAISER, T., OZEKI, K. Decomposing planar cubic graphs. Journal of Graph Theory, 2018, roč. 88, č. 4, s. 631-640. ISSN 0364-9024.en
dc.identifier.document-number435277000007
dc.identifier.doi10.1002/jgt.22234
dc.identifier.issn0364-9024
dc.identifier.obd43927054
dc.identifier.uri2-s2.0-85040370976
dc.identifier.urihttp://hdl.handle.net/11025/35699
dc.language.isoenen
dc.project.IDGA14-19503S/Barevnost a struktura grafůcs
dc.publisherWileyen
dc.relation.ispartofseriesJournal of Graph Theoryen
dc.rightsPlný text není přístupný.cs
dc.rights© Wileyen
dc.rights.accessclosedAccessen
dc.subject.translatedcubic graphen
dc.subject.translateddecompositionen
dc.subject.translated3-regular graphen
dc.subject.translatedseparating cycleen
dc.subject.translatedspanning treeen
dc.titleDecomposing planar cubic graphsen
dc.typečlánekcs
dc.typearticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen

Files

Collections

OBD
 Articles (KMA)
 Articles (NTIS)