2 problems
- 0 votes0 replies0 views
Häggkvist's conjecture on compatible Hamilton cycles
Häggkvist's conjecture. If is a Dirac graph and is a 1-bounded incompatibility system for , then contains an -compatible Hamilton cycle.
- 0 votes0 replies0 views
Häggkvist's compatible Hamilton cycle conjecture
Let be a graph and let be an incompatibility system, where pairs of incident edges are declared incompatible at their common vertex. The syste…