On the smallest sets blocking simple perfect matchings in a convex geometric graph (Q1758986): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s11856-011-0090-9 / rank | |||
| Property / cites work | |||
| Property / cites work: The number of caterpillars / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048864 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11856-011-0090-9 / rank | |||
Normal rank | |||
Latest revision as of 08:54, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the smallest sets blocking simple perfect matchings in a convex geometric graph |
scientific article |
Statements
On the smallest sets blocking simple perfect matchings in a convex geometric graph (English)
0 references
19 November 2012
0 references
geometric graphs
0 references
simple perfect matching
0 references
blocking edge set
0 references
