Decomposing a planar graph with girth at least 8 into a forest and a matching
type: Item
instance of: scholarly article
title: Decomposing a planar graph with girth at least 8 into a forest and a matching
zbMATH Open document ID: 1223.05047
author: Qijun Zhang
author: Yingqian Wang
published in: Discrete Mathematics
publication date: 2011-05-10T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5886369
zbMATH Keywords: planar graph
zbMATH Keywords: decomposing
zbMATH Keywords: girth
zbMATH Keywords: forest
zbMATH Keywords: matching
Wikidata QID: Q60060265
MaRDI profile type: Publication
full work available at URL: j.disc.2011.01.019
OpenAlex ID: W2070483072
cites work: Decomposing a planar graph with girth 9 into a forest and a matching
cites work: Edge-partitions of planar graphs and their game coloring numbers
cites work: Decomposition of sparse graphs into forests and a graph with bounded degree
DOI: 10.1016/J.DISC.2011.01.019
Recommended article: Planar graphs decomposable into a forest and a matching
Recommended article: Decomposing a planar graph with girth 9 into a forest and a matching
Recommended article: Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
Recommended article: Decomposing a graph into forests and a matching
Recommended article: Partitioning a Planar Graph of Girth 10 into a Forest and a Matching
Recommended article: Decomposing a planar graph of girth 5 into an independent set and a forest
Recommended article: Decomposition of some planar graphs into trees
Recommended article: Partitioning edges of a planar graph into linear forests and a matching
Recommended article: Q4017192
Recommended article: On the vertex partition of planar graphs into forests with bounded degree
description: scientific article; zbMATH DE number 5886369