Bogdan Oporowski

From MaRDI portal
(Redirected from Bogdan Oporowski)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Unavoidable induced subgraphs of infinite 2-connected graphs
Discrete Mathematics
2025-02-11Paper
Seymour's second‐neighborhood conjecture from a different perspective
Journal of Graph Theory
2023-10-04Paper
Unavoidable Induced Subgraphs of Large 2-Connected Graphs
SIAM Journal on Discrete Mathematics
2023-06-14Paper
Unavoidable Induced Subgraph of Infinite 2-connected Graphs2022-11-11Paper
A note on immersion intertwines of infinite graphs
Journal of Graph Theory
2019-10-31Paper
Characterizing 2-crossing-critical graphs
Advances in Applied Mathematics
2016-02-11Paper
Bounding tree-width via contraction on the projective plane and torus
The Electronic Journal of Combinatorics
2015-11-02Paper
The excluded minors for the class of matroids that are binary or ternary
European Journal of Combinatorics
2011-08-09Paper
Large non-planar graphs and an application to crossing-critical graphs
Journal of Combinatorial Theory. Series B
2011-03-14Paper
Coloring graphs with crossings
Discrete Mathematics
2009-12-09Paper
Unavoidable parallel minors of 4-connected graphs
Journal of Graph Theory
2009-06-16Paper
Excluding any graph as a minor allows a low tree-width 2-coloring
Journal of Combinatorial Theory. Series B
2004-08-06Paper
Partitioning into graphs with only small components
Journal of Combinatorial Theory. Series B
2003-08-25Paper
Surfaces, tree-width, clique-minors, and partitions
Journal of Combinatorial Theory. Series B
2002-12-10Paper
Partitioning Matroids with Only Small Cocircuits
Combinatorics, Probability and Computing
2002-11-03Paper
Unavoidable minors of graphs of large type
Discrete Mathematics
2002-05-28Paper
Partitioning graphs of bounded tree-width
Combinatorica
1999-10-31Paper
Minor-equivalence for infinite graphs
Discrete Mathematics
1999-08-03Paper
Unavoidable minors of large 3-connected matroids
Journal of Combinatorial Theory. Series B
1998-10-05Paper
Unavoidable minors of large 3-connected binary matroids
Journal of Combinatorial Theory. Series B
1996-11-25Paper
Some results on tree decomposition of graphs
Journal of Graph Theory
1996-05-13Paper
On tree-partitions of graphs
Discrete Mathematics
1996-03-25Paper
On infinite antichains of matroids
Journal of Combinatorial Theory. Series B
1995-07-02Paper
scientific article; zbMATH DE number 475606 (Why is no real title available?)1994-06-22Paper
A note on intertwines of infinite graphs
Journal of Combinatorial Theory. Series B
1994-05-05Paper
A decomposition of locally finite graphs
Discrete Mathematics
1993-11-01Paper
Typical subgraphs of 3- and 4-connected graphs
Journal of Combinatorial Theory. Series B
1993-01-01Paper
A counterexample to Seymour's self‐minor conjecture
Journal of Graph Theory
1992-06-25Paper
scientific article; zbMATH DE number 3936484 (Why is no real title available?)1985-01-01Paper
scientific article; zbMATH DE number 3958707 (Why is no real title available?)1985-01-01Paper


Research outcomes over time


This page was built for person: Bogdan Oporowski