Partitioning a Planar Graph of Girth 10 into a Forest and a Matching (Q3553247): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: Decomposing a planar graph with girth 9 into a forest and a matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimax degrees of quasiplanar graphs with no short cycles other than triangles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimax degrees of quasiplane graphs without 4-faces / rank | |||
Normal rank | |||
Revision as of 17:04, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a Planar Graph of Girth 10 into a Forest and a Matching |
scientific article |
Statements
Partitioning a Planar Graph of Girth 10 into a Forest and a Matching (English)
0 references
22 April 2010
0 references
planar graph
0 references
girth
0 references
edge partition
0 references
forest matching
0 references
