Bogdan Oporowski - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2023

Unavoidable Induced Subgraphs of Large 2-Connected GraphsSarah Allred, Guoli Ding, Bogdan Oporowski. siamdm, 37(2):684-698, June 2023. [doi]

2021

Seymour's second-neighborhood conjecture from a different perspectiveFarid Bouya, Bogdan Oporowski. jgt, 97(3):393-400, 2021. [doi]

2019

A note on immersion intertwines of infinite graphsMatthew Barnes, Bogdan Oporowski. jgt, 92(1):57-62, 2019. [doi]

2016

Characterizing 2-crossing-critical graphsDrago Bokal, Bogdan Oporowski, R. Bruce Richter, Gelasio Salazar. aam, 74:23-208, 2016. [doi]

2015

Bounding Tree-Width via Contraction on the Projective Plane and TorusEvan Morgan, Bogdan Oporowski. combinatorics, 22(4):4, 2015. [doi]

2011

Large non-planar graphs and an application to crossing-critical graphsGuoli Ding, Bogdan Oporowski, Robin Thomas, Dirk Vertigan. JCT, 101(2):111-121, 2011. [doi]

The excluded minors for the class of matroids that are binary or ternaryDillon Mayhew, Bogdan Oporowski, James G. Oxley, Geoff Whittle. ejc, 32(6):891-930, 2011. [doi]

2009

Unavoidable parallel minors of 4-connected graphsCarolyn Chun, Guoli Ding, Bogdan Oporowski, Dirk L. Vertigan. jgt, 60(4):313-326, 2009. [doi]

Coloring graphs with crossingsBogdan Oporowski, David Zhao. DM, 309(9):2948-2951, 2009. [doi]

2007

A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest ConvertersTong Yi, Guoli Ding, Bogdan Oporowski. ipccc 2007: 142-149 [doi]

2004

Excluding any graph as a minor allows a low tree-width 2-coloringMatt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan. JCT, 91(1):25-41, 2004. [doi]

2003

Partitioning into graphs with only small componentsNoga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan. JCT, 87(2):231-243, 2003. [doi]

2002

Unavoidable minors of graphs of large typeJohn Dittmann, Bogdan Oporowski. DM, 248(1-3):27-67, 2002. [doi]

Partitioning Matroids With Only Small CocircuitsBogdan Oporowski. cpc, 11(2):191-197, 2002.

2000

Surfaces, Tree-Width, Clique-Minors, and PartitionsGuoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan. JCT, 79(2):221-246, 2000. [doi]

1999

Minor-equivalence for infinite graphsBogdan Oporowski. DM, 195(1-3):203-227, 1999. [doi]

1998

Partitioning Graphs of Bounded Tree-WidthGuoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan. combinatorica, 18(1):1-12, 1998. [doi]

1997

Unavoidable Minors of Large 3-Connected MatroidsGuoli Ding, Bogdan Oporowski, James G. Oxley, Dirk L. Vertigan. JCT, 71(2):244-293, 1997. [doi]

1996

On tree-partitions of graphsGuoli Ding, Bogdan Oporowski. DM, 149(1-3):45-58, 1996. [doi]

Unavoidable Minors of Large 3-Connected Binary MatroidsGuoli Ding, Bogdan Oporowski, James G. Oxley, Dirk Vertigan. JCT, 66(2):334-360, 1996. [doi]

1995

Some results on tree decomposition of graphsGuoli Ding, Bogdan Oporowski. jgt, 20(4):481-499, 1995. [doi]

On Infinite Antichains of MatroidsGuoli Ding, Bogdan Oporowski, James G. Oxley. JCT, 63(1):21-40, 1995. [doi]

1993

A decomposition of locally finite graphsBogdan Oporowski. DM, 117(1-3):161-168, 1993. [doi]

A Note on Intertwines of Infinite GraphsBogdan Oporowski. JCT, 59(1):69-73, 1993. [doi]

Typical Subgraphs of 3- and 4-Connected GraphsBogdan Oporowski, James G. Oxley, Robin Thomas. JCT, 57(2):239-257, 1993. [doi]

1991

The infinite grid covers the infinite half-gridBogdan Oporowski. gst 1993: 455-460

1990

A counterexample to Seymour's self-minor conjectureBogdan Oporowski. jgt, 14(5):521-524, 1990. [doi]

Sign in or sign up to see more results.

runs on WebDSL