On the vertex partition of planar graphs into forests with bounded degree

Yang Wang, Danjun Huang and Stephen Finbow

Applied Mathematics and Computation, 2020, vol. 374, issue C

Abstract: Let G=(V,E) be a graph. A (Δd1,Δd2)-partition of a graph G is the partition of V(G) into two non-empty subsets V1 and V2, such that G[V1] and G[V2] are graphs with maximum degree at most d1 and d2, respectively. A similar definition can be given for the notation (Fd1,Fd2)-partition if G[V1] and G[V2] are forests with maximum degree at most d1 and d2, respectively.

Keywords: Vertex partition; Maximum degree; Forest; Girth (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320300011
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:374:y:2020:i:c:s0096300320300011

DOI: 10.1016/j.amc.2020.125032

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().