Bogdan Oporowski
Affiliations: | Louisiana State University, Baton Rouge, LA, United States |
Area:
MathematicsGoogle:
"Bogdan Oporowski"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Barnes M, Oporowski B. (2019) A Note On Immersion Intertwines Of Infinite Graphs Journal of Graph Theory. 92: 57-62 |
| Bokal D, Oporowski B, Richter RB, et al. (2016) Characterizing 2-crossing-critical graphs Advances in Applied Mathematics. 74: 23-208 |
| Morgan E, Oporowski B. (2015) Bounding tree-width via contraction on the projective plane and torus Electronic Journal of Combinatorics. 22 |
| Ding G, Oporowski B, Thomas R, et al. (2011) Large non-planar graphs and an application to crossing-critical graphs Journal of Combinatorial Theory. Series B. 101: 111-121 |
| Oporowski B, Zhao D. (2009) Coloring graphs with crossings Discrete Mathematics. 309: 2948-2951 |
| Chun C, Ding G, Oporowski B, et al. (2009) Unavoidable parallel minors of 4-connected graphs Journal of Graph Theory. 60: 313-326 |
| Chun C, Ding G, Oporowski B, et al. (2009) Unavoidable parallel minors of 4-connected graphs Journal of Graph Theory. 60: 313-326 |
| DeVos M, Ding G, Oporowski B, et al. (2004) Excluding any graph as a minor allows a low tree-width 2-coloring Journal of Combinatorial Theory. Series B. 91: 25-41 |
| Alon N, Ding G, Oporowski B, et al. (2003) Partitioning into graphs with only small components Journal of Combinatorial Theory. Series B. 87: 231-243 |
| Dittmann J, Oporowski B. (2002) Unavoidable minors of graphs of large type Discrete Mathematics. 248: 27-67 |