A counterexample to Seymour's self-minor conjecture. - Bogdan Oporowski (J. Graph Theory, 1990)

The infinite grid covers the infinite half-grid. - Bogdan Oporowski (Graph Structure Theory, 1991)

A decomposition of locally finite graphs. - Bogdan Oporowski (Discret. Math., 1993)

A Note on Intertwines of Infinite Graphs. - Bogdan Oporowski (J. Comb. Theory B, 1993)

Typical Subgraphs of 3- and 4-Connected Graphs. - Bogdan Oporowski; James G. Oxley; Robin Thomas 001 (J. Comb. Theory B, 1993)

On Infinite Antichains of Matroids. - Guoli Ding; Bogdan Oporowski; James G. Oxley (J. Comb. Theory B, 1995)

Some results on tree decomposition of graphs. - Guoli Ding; Bogdan Oporowski (J. Graph Theory, 1995)

On tree-partitions of graphs. - Guoli Ding; Bogdan Oporowski (Discret. Math., 1996)

Unavoidable Minors of Large 3-Connected Binary Matroids. - Guoli Ding; Bogdan Oporowski; James G. Oxley; Dirk Vertigan (J. Comb. Theory B, 1996)

Unavoidable Minors of Large 3-Connected Matroids. - Guoli Ding; Bogdan Oporowski; James G. Oxley; Dirk L. Vertigan (J. Comb. Theory B, 1997)

Partitioning Graphs of Bounded Tree-Width. - Guoli Ding; Bogdan Oporowski; Daniel P. Sanders 001; Dirk Vertigan (Comb., 1998)

Minor-equivalence for infinite graphs. - Bogdan Oporowski (Discret. Math., 1999)

Surfaces, Tree-Width, Clique-Minors, and Partitions. - Guoli Ding; Bogdan Oporowski; Daniel P. Sanders 001; Dirk L. Vertigan (J. Comb. Theory B, 2000)

Partitioning Matroids With Only Small Cocircuits. - Bogdan Oporowski (Comb. Probab. Comput., 2002)

Unavoidable minors of graphs of large type. - John Dittmann; Bogdan Oporowski (Discret. Math., 2002)

Partitioning into graphs with only small components. - Noga Alon; Guoli Ding; Bogdan Oporowski; Dirk Vertigan (J. Comb. Theory B, 2003)

Excluding any graph as a minor allows a low tree-width 2-coloring. - Matt DeVos; Guoli Ding; Bogdan Oporowski; Daniel P. Sanders 001; Bruce A. Reed; Paul D. Seymour; Dirk Vertigan (J. Comb. Theory B, 2004)

A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters. - Tong Yi; Guoli Ding; Bogdan Oporowski (IPCCC, 2007)

Coloring graphs with crossings. - Bogdan Oporowski; David Zhao (Discret. Math., 2009)

Unavoidable parallel minors of 4-connected graphs. - Carolyn Chun; Guoli Ding; Bogdan Oporowski; Dirk L. Vertigan (J. Graph Theory, 2009)

The excluded minors for the class of matroids that are binary or ternary. - Dillon Mayhew; Bogdan Oporowski; James G. Oxley; Geoff Whittle (Eur. J. Comb., 2011)

Large non-planar graphs and an application to crossing-critical graphs. - Guoli Ding; Bogdan Oporowski; Robin Thomas 001; Dirk Vertigan (J. Comb. Theory B, 2011)

Bounding Tree-Width via Contraction on the Projective Plane and Torus. - Evan Morgan; Bogdan Oporowski (Electron. J. Comb., 2015)

Characterizing 2-crossing-critical graphs. - Drago Bokal; Bogdan Oporowski; R. Bruce Richter; Gelasio Salazar (Adv. Appl. Math., 2016)

A note on immersion intertwines of infinite graphs. - Matthew Barnes; Bogdan Oporowski (J. Graph Theory, 2019)

Seymour's second-neighborhood conjecture from a different perspective. - Farid Bouya; Bogdan Oporowski (J. Graph Theory, 2021)

Unavoidable Induced Subgraphs of Large 2-Connected Graphs. - Sarah Allred; Guoli Ding; Bogdan Oporowski (SIAM J. Discret. Math., 2023)

Unavoidable induced subgraphs of infinite 2-connected graphs. - Sarah Allred; Guoli Ding; Bogdan Oporowski (Discret. Math., 2025)