"All trees contain a large induced subgraph having all degrees 1 (mod k)."

David M. Berman et al. (1997)

Details and statistics

DOI: 10.1016/S0012-365X(96)00283-X

access: open

type: Journal Article

metadata version: 2021-02-12

a service of  Schloss Dagstuhl - Leibniz Center for Informatics