Browsing University of Waterloo by Subject "Pt-free"
Now showing items 1-1 of 1
(Elsevier, 2019-08-31)A graph is called Pt-free if it does not contain the path on t vertices as an induced subgraph. Let H be a multigraph with the property that any two distinct vertices share at most one common neighbour. We show that the ...