The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree

Frederik Garbe, Richard Mycroft. The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree. In Nicolas Ollinger, Heribert Vollmer, editors, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France. Volume 47 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.