The following pages link to Sang-il Oum (Q256976):
Displaying 50 items.
- Unavoidable induced subgraphs in large graphs with no homogeneous sets (Q256979) (← links)
- Dynamic coloring of graphs having no \(K_5\) minor (Q277625) (← links)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- An analog of Brooks' theorem for dynamic colorings (Q509086) (← links)
- Perfect matchings in claw-free cubic graphs (Q540046) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- Unavoidable vertex-minors in large prime graphs (Q740266) (← links)
- Excluded vertex-minors for graphs of linear rank-width at most \(k\) (Q740279) (← links)
- Obstructions for partitioning into forests and outerplanar graphs (Q831856) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Testing branch-width (Q875941) (← links)
- (Q989473) (redirect page) (← links)
- Computing rank-width exactly (Q989474) (← links)
- Computing small pivot-minors (Q1627161) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- A remark on the paper ``Properties of intersecting families of ordered sets'' by O. Einstein (Q1715084) (← links)
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221) (← links)
- Vertex-minors and the Erdős-Hajnal conjecture (Q1800420) (← links)
- Equitable partition of planar graphs (Q2022132) (← links)
- Obstructions for bounded shrub-depth and rank-depth (Q2033913) (← links)
- Characterizing matroids whose bases form graphic delta-matroids (Q2066014) (← links)
- Independent domination of graphs with bounded maximum degree (Q2101177) (← links)
- Rank connectivity and pivot-minors of graphs (Q2107500) (← links)
- Tangle-tree duality in abstract separation systems (Q2217534) (← links)
- The average cut-rank of graphs (Q2225395) (← links)
- Branch-depth: generalizing tree-depth of graphs (Q2225398) (← links)
- Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded (Q2284734) (← links)
- Defective colouring of graphs excluding a subgraph or minor (Q2322507) (← links)
- Tangle-tree duality: in graphs, matroids and beyond (Q2338616) (← links)
- Finding minimum clique capacity (Q2392036) (← links)
- Even-cycle decompositions of graphs with no odd-\(K_4\)-minor (Q2400967) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices (Q2427899) (← links)
- Graphs of small rank-width are pivot-minors of graphs of small tree-width (Q2442212) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Rank-width and vertex-minors (Q2565688) (← links)
- Majority colourings of digraphs (Q2628255) (← links)
- The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor (Q2662350) (← links)
- Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (Q2692778) (← links)
- (Q2857429) (← links)
- Rank-width of random graphs (Q2897211) (← links)
- Hyperbolic surface subgroups of one-ended doubles of free groups (Q2934805) (← links)
- Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract) (Q2945175) (← links)
- Classification of real Bott manifolds and acyclic digraphs (Q2951926) (← links)
- Excluded vertex-minors for graphs of linear rank-width at most k. (Q2957886) (← links)
- Strongly Even-Cycle Decomposable Graphs (Q2958205) (← links)
- Deciding First Order Properties of Matroids (Q3167015) (← links)
- Rank-width and Well-quasi-ordering of Skew-symmetric Matrices (Q3439350) (← links)
- Number of Cliques in Graphs with a Forbidden Subdivision (Q3449861) (← links)
