|
Search the dblp DataBase
Bogdan Oporowski:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Bogdan Oporowski
The infinite grid covers the infinite half-grid. [Citation Graph (0, 0)][DBLP] Graph Structure Theory, 1991, pp:455-460 [Conf]
- Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan
Partitioning Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP] Combinatorica, 1998, v:18, n:1, pp:1-12 [Journal]
- Bogdan Oporowski
Partitioning Matroids With Only Small Cocircuits. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2002, v:11, n:2, pp:- [Journal]
- John Dittmann, Bogdan Oporowski
Unavoidable minors of graphs of large type. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:248, n:1-3, pp:27-67 [Journal]
- Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan
Partitioning into graphs with only small components. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:231-243 [Journal]
- Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan
Excluding any graph as a minor allows a low tree-width 2-coloring. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:25-41 [Journal]
- Guoli Ding, Bogdan Oporowski, James G. Oxley
On Infinite Antichains of Matroids. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1995, v:63, n:1, pp:21-40 [Journal]
- Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk Vertigan
Unavoidable Minors of Large 3-Connected Binary Matroids. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:334-360 [Journal]
- Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk L. Vertigan
Unavoidable Minors of Large 3-Connected Matroids. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1997, v:71, n:2, pp:244-293 [Journal]
- Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan
Surfaces, Tree-Width, Clique-Minors, and Partitions. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2000, v:79, n:2, pp:221-246 [Journal]
- Bogdan Oporowski
A Note on Intertwines of Infinite Graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1993, v:59, n:1, pp:69-73 [Journal]
- Bogdan Oporowski, James G. Oxley, Robin Thomas
Typical Subgraphs of 3- and 4-Connected Graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1993, v:57, n:2, pp:239-257 [Journal]
- Bogdan Oporowski
Minor-equivalence for infinite graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:195, n:1-3, pp:203-227 [Journal]
- Bogdan Oporowski
A decomposition of locally finite graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1993, v:117, n:1-3, pp:161-168 [Journal]
- Guoli Ding, Bogdan Oporowski
On tree-partitions of graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:149, n:1-3, pp:45-58 [Journal]
A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters. [Citation Graph (, )][DBLP]
Coloring graphs with crossings. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|