Blockers for simple Hamiltonian paths in convex geometric graphs of even order (Q724939): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5692701 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Turán-type theorem on chords of a convex polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The number of caterpillars / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the smallest sets blocking simple perfect matchings in a convex geometric graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048864 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extremal theory for convex matchings in convex geometric graphs / rank | |||
Normal rank | |||
Revision as of 04:54, 16 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Blockers for simple Hamiltonian paths in convex geometric graphs of even order |
scientific article |
Statements
Blockers for simple Hamiltonian paths in convex geometric graphs of even order (English)
0 references
26 July 2018
0 references
geometric graph
0 references
simple Hamiltonian path
0 references
blocker
0 references
caterpillar
0 references
