"Reachability in K{3, 3}-free and K5-free Graphs is ..."

Thomas Thierauf, Fabian Wagner (2014)

Details and statistics

DOI:

access: open

type: Journal Article

metadata version: 2021-02-11

a service of  Schloss Dagstuhl - Leibniz Center for Informatics