Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2011.01.019 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2011.01.019 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070483072 / rank | |||
Normal rank | |||
| 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 | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2011.01.019 / rank | |||
Normal rank | |||
Latest revision as of 20:44, 9 December 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
