This document discusses a method called Patchy for applying convolutional neural networks to graph-structured data. Patchy selects node sequences from graphs using centrality measures and assembles neighborhoods around the nodes. The neighborhoods are normalized and used as receptive fields for a convolutional architecture. Experiments on graph classification benchmarks show Patchy can outperform graph kernels in terms of efficiency and effectiveness while also supporting visualization of learned edge filters. Potential limitations include increased risk of overfitting on small datasets compared to graph kernels.