Bogdan Oporowski

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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Unavoidable Induced Subgraphs of Large 2-Connected Graphs.
SIAM J. Discret. Math., June, 2023

2021
Seymour's second-neighborhood conjecture from a different perspective.
J. Graph Theory, 2021

2019
A note on immersion intertwines of infinite graphs.
J. Graph Theory, 2019

2016
Characterizing 2-crossing-critical graphs.
Adv. Appl. Math., 2016

2015
Bounding Tree-Width via Contraction on the Projective Plane and Torus.
Electron. J. Comb., 2015

2011
Large non-planar graphs and an application to crossing-critical graphs.
J. Comb. Theory B, 2011

The excluded minors for the class of matroids that are binary or ternary.
Eur. J. Comb., 2011

2009
Unavoidable parallel minors of 4-connected graphs.
J. Graph Theory, 2009

Coloring graphs with crossings.
Discret. Math., 2009

2007
A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters.
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.
J. Comb. Theory B, 2004

2003
Partitioning into graphs with only small components.
J. Comb. Theory B, 2003

2002
Unavoidable minors of graphs of large type.
Discret. Math., 2002

Partitioning Matroids With Only Small Cocircuits.
Comb. Probab. Comput., 2002

2000
Surfaces, Tree-Width, Clique-Minors, and Partitions.
J. Comb. Theory B, 2000

1999
Minor-equivalence for infinite graphs.
Discret. Math., 1999

1998
Partitioning Graphs of Bounded Tree-Width.
Comb., 1998

1997
Unavoidable Minors of Large 3-Connected Matroids.
J. Comb. Theory B, 1997

1996
Unavoidable Minors of Large 3-Connected Binary Matroids.
J. Comb. Theory B, 1996

On tree-partitions of graphs.
Discret. Math., 1996

1995
Some results on tree decomposition of graphs.
J. Graph Theory, 1995

On Infinite Antichains of Matroids.
J. Comb. Theory B, 1995

1993
Typical Subgraphs of 3- and 4-Connected Graphs.
J. Comb. Theory B, 1993

A Note on Intertwines of Infinite Graphs.
J. Comb. Theory B, 1993

A decomposition of locally finite graphs.
Discret. Math., 1993

1991
The infinite grid covers the infinite half-grid.
Proceedings of the Graph Structure Theory, 1991

1990
A counterexample to Seymour's self-minor conjecture.
J. Graph Theory, 1990


  Loading...