Bogdan Oporowski

28 papers C 1Journal 26Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Unavoidable induced subgraphs of infinite 2-connected graphs.
Discret. Math.
Sarah Allred, Guoli Ding, Bogdan Oporowski
2023 J jnl
Unavoidable Induced Subgraphs of Large 2-Connected Graphs.
SIAM J. Discret. Math.
Sarah Allred, Guoli Ding, Bogdan Oporowski
2021 J jnl
Seymour's second-neighborhood conjecture from a different perspective.
J. Graph Theory
Farid Bouya, Bogdan Oporowski
2019 J jnl
A note on immersion intertwines of infinite graphs.
J. Graph Theory
Matthew Barnes, Bogdan Oporowski
2016 J jnl
Characterizing 2-crossing-critical graphs.
Adv. Appl. Math.
Drago Bokal, Bogdan Oporowski, R. Bruce Richter, Gelasio Salazar
2015 J jnl
Bounding Tree-Width via Contraction on the Projective Plane and Torus.
Electron. J. Comb.
Evan Morgan, Bogdan Oporowski
2011 J jnl
Large non-planar graphs and an application to crossing-critical graphs.
J. Comb. Theory B
Guoli Ding, Bogdan Oporowski, Robin Thomas, Dirk Vertigan
2011 J jnl
The excluded minors for the class of matroids that are binary or ternary.
Eur. J. Comb.
Dillon Mayhew, Bogdan Oporowski, James G. Oxley, Geoff Whittle
2009 J jnl
Coloring graphs with crossings.
Discret. Math.
Bogdan Oporowski, David Zhao
2009 J jnl
Unavoidable parallel minors of 4-connected graphs.
J. Graph Theory
Carolyn Chun, Guoli Ding, Bogdan Oporowski, Dirk L. Vertigan
2007 C conf
A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters.
IPCCC
Tong Yi, Guoli Ding, Bogdan Oporowski
2004 J jnl
Excluding any graph as a minor allows a low tree-width 2-coloring.
J. Comb. Theory B
Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan
2003 J jnl
Partitioning into graphs with only small components.
J. Comb. Theory B
Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan
2002 J jnl
Partitioning Matroids With Only Small Cocircuits.
Comb. Probab. Comput.
Bogdan Oporowski
2002 J jnl
Unavoidable minors of graphs of large type.
Discret. Math.
John Dittmann, Bogdan Oporowski
2000 J jnl
Surfaces, Tree-Width, Clique-Minors, and Partitions.
J. Comb. Theory B
Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan
1999 J jnl
Minor-equivalence for infinite graphs.
Discret. Math.
Bogdan Oporowski
1998 J jnl
Partitioning Graphs of Bounded Tree-Width.
Comb.
Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan
1997 J jnl
Unavoidable Minors of Large 3-Connected Matroids.
J. Comb. Theory B
Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk L. Vertigan
1996 J jnl
On tree-partitions of graphs.
Discret. Math.
Guoli Ding, Bogdan Oporowski
1996 J jnl
Unavoidable Minors of Large 3-Connected Binary Matroids.
J. Comb. Theory B
Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk Vertigan
1995 J jnl
On Infinite Antichains of Matroids.
J. Comb. Theory B
Guoli Ding, Bogdan Oporowski, James G. Oxley
1995 J jnl
Some results on tree decomposition of graphs.
J. Graph Theory
Guoli Ding, Bogdan Oporowski
1993 J jnl
A Note on Intertwines of Infinite Graphs.
J. Comb. Theory B
Bogdan Oporowski
1993 J jnl
A decomposition of locally finite graphs.
Discret. Math.
Bogdan Oporowski
1993 J jnl
Typical Subgraphs of 3- and 4-Connected Graphs.
J. Comb. Theory B
Bogdan Oporowski, James G. Oxley, Robin Thomas
1991 — conf
The infinite grid covers the infinite half-grid.
Graph Structure Theory
Bogdan Oporowski
1990 J jnl
A counterexample to Seymour's self-minor conjecture.
J. Graph Theory
Bogdan Oporowski