On the smallest sets blocking simple perfect matchings in a convex geometric graph (Q1758986): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The number of caterpillars / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048864 / rank | |||
Normal rank | |||
Revision as of 21:17, 5 July 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
