"Covering 3-uniform hypergraphs by vertex-disjoint tight paths."

Jie Han (2022)

Details and statistics

DOI: 10.1002/JGT.22853

access: closed

type: Journal Article

metadata version: 2022-12-05

a service of  Schloss Dagstuhl - Leibniz Center for Informatics