The following pages link to Sang-Il Oum (Q256976):
Displaying 48 items.
- A Relative of Hadwiger's Conjecture (Q3461983) (← links)
- Certifying large branch-width (Q3581552) (← links)
- Excluding a bipartite circle graph from line graphs (Q3608319) (← links)
- Rank-Width and Well-Quasi-Ordering (Q3629468) (← links)
- Circle graph obstructions under pivoting (Q3633003) (← links)
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
- The “Art of Trellis Decoding” Is Fixed-Parameter Tractable (Q4566553) (← links)
- Constructive algorithm for path-width of matroids (Q4575700) (← links)
- Scattered Classes of Graphs (Q4959761) (← links)
- Approximating rank-width and clique-width quickly (Q4962768) (← links)
- Finding branch-decompositions of matroids, hypergraphs, and more (Q5002759) (← links)
- Finding Branch-Decompositions of Matroids, Hypergraphs, and More (Q5013567) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- Bounds for the Twin-Width of Graphs (Q5043639) (← links)
- (Q5089163) (← links)
- Obstructions for Bounded Branch-depth in Matroids (Q5162868) (← links)
- Improper colouring of graphs with no odd clique minor (Q5222552) (← links)
- Online Ramsey theory for a triangle on ‐free graphs (Q5241610) (← links)
- Rank‐width is less than or equal to branch‐width (Q5450349) (← links)
- Intertwining Connectivities for Vertex-Minors and Pivot-Minors (Q5883288) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5890901) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897543) (← links)
- Finding Branch-Decompositions and Rank-Decompositions (Q5900367) (← links)
- Finding Branch-Decompositions and Rank-Decompositions (Q5902074) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769) (← links)
- Chi-boundedness of graph classes excluding wheel vertex-minors (Q5915809) (← links)
- Guest editors' foreword (Q5971208) (← links)
- A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
- Graphs of bounded depth‐2 rank‐brittleness (Q6055398) (← links)
- 3‐Degenerate induced subgraph of a planar graph (Q6056810) (← links)
- (Q6065388) (← links)
- \(\Gamma\)-graphic delta-matroids and their applications (Q6081409) (← links)
- A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors (Q6115787) (← links)
- (Q6187839) (← links)
- A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups (Q6199337) (← links)
- Prime vertex-minors of a prime graph (Q6201871) (← links)
- Graphs of bounded depth-$2$ rank-brittleness (Q6320460) (← links)
- A polynomial kernel for $3$-leaf power deletion (Q6328924) (← links)
- Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k (Q6378556) (← links)
- Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (Q6490986) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
- Twin-width of random graphs (Q6507323) (← links)
- Linear bounds on treewidth in terms of excluded planar minors (Q6523610) (← links)
- Tree pivot-minors and linear rank-width (Q6621185) (← links)
- Twin-width of random graphs (Q6641067) (← links)
- Space-efficient parameterized algorithms on graphs of low shrubdepth (Q6656958) (← links)
- Sharing tea on a graph (Q6729934) (← links)
- Colouring t-perfect graphs (Q6759575) (← links)
