<div class="csl-bib-body">
<div class="csl-entry">Hoffmann-Ostenhof, A., Noguchi, K., & Ozeki, K. (2018). On homeomorphically irreducible spanning trees in cubic graphs. <i>Journal of Graph Theory</i>, <i>89</i>(2), 93–100. https://doi.org/10.1002/jgt.22242</div>
</div>
-
dc.identifier.issn
0364-9024
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/145495
-
dc.description.abstract
A spanning tree without a vertex of degree two is called a HIST, which is an abbreviation for homeomorphically irreducible spanning tree. We provide a necessary condition for the existence of a HIST in a cubic graph. As one consequence, we answer affirmatively an open question on HISTs by Albertson, Berman, Hutchinson, and Thomassen. We also show several results on the existence of HISTs in plane and toroidal cubic graphs.
en
dc.language.iso
en
-
dc.relation.ispartof
Journal of Graph Theory
-
dc.subject
Discrete Mathematics and Combinatorics
en
dc.subject
Geometry and Topology
en
dc.subject
Bipartite
en
dc.subject
cubic graph
en
dc.subject
cyclic edge-connetivity
en
dc.subject
fullerene
en
dc.subject
HIST
en
dc.subject
spanning tree
en
dc.title
On homeomorphically irreducible spanning trees in cubic graphs
en
dc.type
Artikel
de
dc.type
Article
en
dc.description.startpage
93
-
dc.description.endpage
100
-
dc.type.category
Original Research Article
-
tuw.container.volume
89
-
tuw.container.issue
2
-
tuw.journal.peerreviewed
true
-
tuw.peerreviewed
true
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
dcterms.isPartOf.title
Journal of Graph Theory
-
tuw.publication.orgunit
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
tuw.publisher.doi
10.1002/jgt.22242
-
dc.date.onlinefirst
2018-02-19
-
dc.identifier.eissn
1097-0118
-
dc.description.numberOfPages
8
-
tuw.author.orcid
0000-0002-7790-0782
-
tuw.author.orcid
0000-0003-3118-0086
-
wb.sci
true
-
wb.sciencebranch
Informatik
-
wb.sciencebranch.oefos
1020
-
wb.facultyfocus
Logic and Computation (LC)
de
wb.facultyfocus
Logic and Computation (LC)
en
wb.facultyfocus.faculty
E180
-
item.fulltext
no Fulltext
-
item.openairetype
research article
-
item.languageiso639-1
en
-
item.grantfulltext
restricted
-
item.openairecristype
http://purl.org/coar/resource_type/c_2df8fbb1
-
item.cerifentitytype
Publications
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity