Covering and tiling hypergraphs with tight cycles (2017)
Attributed to:
A graph theoretical approach for combinatorial designs
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1016/j.endm.2017.07.008
Publication URI: http://dx.doi.org/10.1016/j.endm.2017.07.008
Type: Journal Article/Review
Parent Publication: Electronic Notes in Discrete Mathematics