The following pages link to Ken-ichi Kawarabayashi (Q214979):
Displaying 46 items.
- Orientable and Nonorientable Genera for Some Complete Tripartite Graphs (Q5317563) (← links)
- Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs (Q5346553) (← links)
- (Q5376371) (← links)
- An Excluded Grid Theorem for Digraphs with Forbidden Minors (Q5383965) (← links)
- Linkless and flat embeddings in 3-space and the unknot problem (Q5405867) (← links)
- (Q5417627) (← links)
- (Q5417628) (← links)
- (Q5417629) (← links)
- (Q5417631) (← links)
- Breaking o(n <sup>1/2</sup> )-approximation algorithms for the edge-disjoint paths problem with congestion two (Q5419077) (← links)
- Contraction decomposition in h-minor-free graphs and algorithmic applications (Q5419114) (← links)
- A simpler algorithm and shorter proof for the graph minor decomposition (Q5419115) (← links)
- Finding topological subgraphs is fixed-parameter tractable (Q5419118) (← links)
- Independence number and clique minors (Q5434255) (← links)
- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction (Q5459097) (← links)
- (Q5461493) (← links)
- (Q5461555) (← links)
- Domination in a graph with a 2‐factor (Q5471053) (← links)
- The Graph Minor Algorithm with Parity Conditions (Q5494959) (← links)
- The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable (Q5494963) (← links)
- Testing subdivision-freeness (Q5495814) (← links)
- (Q5708555) (← links)
- (Q5708572) (← links)
- Packing directed cycles through a specified vertex set (Q5741735) (← links)
- 4-connected projective-planar graphs are hamiltonian-connected (Q5741736) (← links)
- A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory– (Q5741738) (← links)
- More Compact Oracles for Approximate Distances in Undirected Planar Graphs (Q5741748) (← links)
- 5-coloring <i>K</i><sub>3,<i>k</i></sub>-minor-free graphs (Q5741779) (← links)
- List-coloring embedded graphs (Q5741780) (← links)
- Totally odd subdivisions and parity subdivisions: Structures and Coloring (Q5741781) (← links)
- (Q5743429) (← links)
- (Q5743487) (← links)
- (Q5743513) (← links)
- Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set (Q5855246) (← links)
- Hamiltonian cycles in \(n\)-factor-critical graphs (Q5948969) (← links)
- Path factors in claw-free graphs (Q5957707) (← links)
- A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups (Q6199337) (← links)
- Tight Upper Bounds on the Crossing Number in a Minor-Closed Class (Q6304845) (← links)
- A half-integral Erd\H{o}s-P\'osa theorem for directed odd cycles (Q6345733) (← links)
- Optimal distributed covering algorithms (Q6487522) (← links)
- Parameterized distributed algorithms (Q6487523) (← links)
- Improved distributed approximations for maximum independent set (Q6535034) (← links)
- Directed tangle tree-decompositions and applications (Q6575091) (← links)
- Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem (Q6730156) (← links)
- Better coloring of 3-colorable graphs (Q6731006) (← links)
- An analogue of Reed's conjecture for digraphs (Q6735615) (← links)
