Decomposition of some planar graphs into trees

Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/14956

DC Field	Value	Language
dc.contributor.author	Petrović, Vojislav	en_US
dc.date.accessioned	2020-03-03T14:58:02Z	-
dc.date.available	2020-03-03T14:58:02Z	-
dc.date.issued	1996-04-06	-
dc.identifier.issn	0012365X	en_US
dc.identifier.uri	https://open.uns.ac.rs/handle/123456789/14956	-
dc.description.abstract	We prove that each simple planar graph G whose all faces are quadrilaterals can be decomposed into two disjoint trees Tr and Tb such that V(Tr) = V(G - u) and V(Tb) = V(G - v) for any two non-adjacent vertices u and v of G.	en
dc.relation.ispartof	Discrete Mathematics	en
dc.title	Decomposition of some planar graphs into trees	en_US
dc.type	Journal/Magazine Article	en_US
dc.identifier.doi	10.1016/0012-365X(95)00214-H	-
dc.identifier.scopus	2-s2.0-0042631306	-
dc.identifier.url	https://api.elsevier.com/content/abstract/scopus_id/0042631306	-
dc.description.version	Unknown	en_US
dc.relation.lastpage	451	en
dc.relation.firstpage	449	en
dc.relation.issue	1-3	en
dc.relation.volume	150	en
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
crisitem.author.dept	Prirodno-matematički fakultet, Departman za matematiku i informatiku	-
crisitem.author.parentorg	Prirodno-matematički fakultet	-
Appears in Collections:	PMF Publikacije/Publications

3

checked on Nov 20, 2023

6

Last Week
6

Last month
0

checked on May 3, 2024

Check