Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Decomposing a planar graph with girth at least 8 into a forest and a matching |
scientific article |
Statements
Decomposing a planar graph with girth at least 8 into a forest and a matching (English)
0 references
10 May 2011
0 references