Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Decomposing a planar graph with girth 9 into a forest and a matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge-partitions of planar graphs and their game coloring numbers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree / rank | |||
Normal rank | |||
Revision as of 00:27, 4 July 2024
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
planar graph
0 references
decomposing
0 references
girth
0 references
forest
0 references
matching
0 references
