Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 5886369 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
planar graph | |||
| Property / zbMATH Keywords: planar graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
decomposing | |||
| Property / zbMATH Keywords: decomposing / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
girth | |||
| Property / zbMATH Keywords: girth / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
forest | |||
| Property / zbMATH Keywords: forest / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
matching | |||
| Property / zbMATH Keywords: matching / rank | |||
Normal rank | |||
Revision as of 08:34, 1 July 2023
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
