Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/14956
Title: | Decomposition of some planar graphs into trees | Authors: | Petrović, Vojislav | Issue Date: | 6-Apr-1996 | Journal: | Discrete Mathematics | 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. | URI: | https://open.uns.ac.rs/handle/123456789/14956 | ISSN: | 0012365X | DOI: | 10.1016/0012-365X(95)00214-H |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
3
checked on Nov 20, 2023
Page view(s)
6
Last Week
6
6
Last month
0
0
checked on May 3, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.