Bogdan Oporowski

According to our database, Bogdan Oporowski authored at least 27 papers between 1990 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Unavoidable Induced Subgraphs of Large 2-Connected Graphs.

Sarah Allred, Guoli Ding, Bogdan Oporowski

SIAM J. Discret. Math., June, 2023

2021

Seymour's second-neighborhood conjecture from a different perspective.

Farid Bouya, Bogdan Oporowski

J. Graph Theory, 2021

2019

A note on immersion intertwines of infinite graphs.

Matthew Barnes, Bogdan Oporowski

J. Graph Theory, 2019

2016

Characterizing 2-crossing-critical graphs.

Drago Bokal, Bogdan Oporowski, R. Bruce Richter, Gelasio Salazar

Adv. Appl. Math., 2016

2015

Bounding Tree-Width via Contraction on the Projective Plane and Torus.

Evan Morgan, Bogdan Oporowski

Electron. J. Comb., 2015

2011

Large non-planar graphs and an application to crossing-critical graphs.

Guoli Ding, Bogdan Oporowski, Robin Thomas, Dirk Vertigan

J. Comb. Theory, Ser. B, 2011

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

2009

Unavoidable parallel minors of 4-connected graphs.

Carolyn Chun, Guoli Ding, Bogdan Oporowski, Dirk L. Vertigan

J. Graph Theory, 2009

Coloring graphs with crossings.

Bogdan Oporowski, David Zhao

Discret. Math., 2009

2007

A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters.

Tong Yi, Guoli Ding, Bogdan Oporowski

Proceedings of the 26th IEEE International Performance Computing and Communications Conference, 2007

2004

Excluding any graph as a minor allows a low tree-width 2-coloring.

Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan

J. Comb. Theory, Ser. B, 2004

2003

Partitioning into graphs with only small components.

Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan

J. Comb. Theory, Ser. B, 2003

2002

Unavoidable minors of graphs of large type.

John Dittmann, Bogdan Oporowski

Discret. Math., 2002

Partitioning Matroids With Only Small Cocircuits.

Bogdan Oporowski

Comb. Probab. Comput., 2002

2000

Surfaces, Tree-Width, Clique-Minors, and Partitions.

Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan

J. Comb. Theory, Ser. B, 2000

1999

Minor-equivalence for infinite graphs.

Bogdan Oporowski

Discret. Math., 1999

1998

Partitioning Graphs of Bounded Tree-Width.

Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan

Comb., 1998

1997

Unavoidable Minors of Large 3-Connected Matroids.

Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk L. Vertigan

J. Comb. Theory, Ser. B, 1997

1996

Unavoidable Minors of Large 3-Connected Binary Matroids.

Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk Vertigan

J. Comb. Theory, Ser. B, 1996

On tree-partitions of graphs.

Guoli Ding, Bogdan Oporowski

Discret. Math., 1996

1995

Some results on tree decomposition of graphs.

Guoli Ding, Bogdan Oporowski

J. Graph Theory, 1995

On Infinite Antichains of Matroids.

Guoli Ding, Bogdan Oporowski, James G. Oxley

J. Comb. Theory, Ser. B, 1995

1993

Typical Subgraphs of 3- and 4-Connected Graphs.

Bogdan Oporowski, James G. Oxley, Robin Thomas

J. Comb. Theory, Ser. B, 1993

A Note on Intertwines of Infinite Graphs.

Bogdan Oporowski

J. Comb. Theory, Ser. B, 1993

A decomposition of locally finite graphs.

Bogdan Oporowski

Discret. Math., 1993

1991

The infinite grid covers the infinite half-grid.

Bogdan Oporowski

Proceedings of the Graph Structure Theory, 1991

1990

A counterexample to Seymour's self-minor conjecture.

Bogdan Oporowski

J. Graph Theory, 1990