Name
Abstract | ||
|---|---|---|
Let be a complete convex geometric graph on 2 vertices, and let be a family of subgraphs of . A for is a set of edges, of smallest possible size, that meets every element of . In Keller and Perles (Israel J Math 187:465–484, ) we gave an explicit description of all blockers for the family of simple perfect matchings (SPMs) of . In this paper we show that the family of simple Hamiltonian paths in has exactly the same blockers as the family of SPMs. Our argument is rather short, and provides a much simpler proof of the result of Keller and Perles
(). |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s00454-017-9921-8 | Discrete & Computational Geometry |
Keywords | Field | DocType |
Geometric graph,Simple Hamiltonian path,Blocker,Caterpillar,05C30,05C62 | Discrete mathematics,Graph,Combinatorics,Spatial network,Hamiltonian (quantum mechanics),Regular polygon,Mathematics | Journal |
Volume | Issue | ISSN |
60 | 1 | 0179-5376 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chaya Keller | 1 | 3 | 4.52 |
| Micha A. Perles | 2 | 38 | 10.65 |