The following pages link to Ken-ichi Kawarabayashi (Q214979):
Displaying 50 items.
- Improved upper bounds on the crossing number (Q3602937) (← links)
- A Weakening of the Odd Hadwiger's Conjecture (Q3608337) (← links)
- Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs (Q3638044) (← links)
- Path factors in cubic graphs (Q3651178) (← links)
- K-linked graphs with girth condition (Q4446886) (← links)
- Vertex-disjoint cycles containing specified vertices in a bipartite graph (Q4474280) (← links)
- (Q4514553) (← links)
- <i>K</i><sub>4</sub><sup>−</sup>‐factor in a graph (Q4534211) (← links)
- Hamiltonian cycles in <i>n</i>‐extendable graphs (Q4539871) (← links)
- (Q4547810) (← links)
- All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs (Q4577772) (← links)
- (Q4607893) (← links)
- Deterministic Edge Connectivity in Near-Linear Time (Q4625670) (← links)
- (Q4633929) (← links)
- (Q4633930) (← links)
- (Q4633931) (← links)
- (Q4633932) (← links)
- (Q4633933) (← links)
- Detecting even holes (Q4667791) (← links)
- Vertex-disjoint copies of K<sub>4</sub><sup>-</sup> (Q4669432) (← links)
- On Properties of a Set of Global Roundings Associated with Clique Connection of Graphs (Q4678082) (← links)
- Graph minors and linkages (Q4680407) (← links)
- 2-connected 7-coverings of 3-connected graphs on surfaces (Q4808404) (← links)
- Packing Directed Circuits through Prescribed Vertices Bounded Fractionally (Q4899052) (← links)
- An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two (Q4962640) (← links)
- Isomorphisms of maps on the sphere (Q4998745) (← links)
- Additive non-approximability of chromatic number in proper minor-closed classes (Q5002722) (← links)
- (Q5090928) (← links)
- Model-Checking on Ordered Structures (Q5121264) (← links)
- Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
- Optimal Distributed Covering Algorithms (Q5145187) (← links)
- The Directed Flat Wall Theorem (Q5146780) (← links)
- A nearly 5/3-approximation FPT Algorithm for Min-<i>k</i>-Cut (Q5146830) (← links)
- An Approximation Algorithm for the Bipartite Traveling Tournament Problem (Q5169687) (← links)
- Planarity Allowing Few Error Vertices in Linear Time (Q5171202) (← links)
- Hadwiger's conjecture is decidable (Q5172739) (← links)
- Dominating sets in triangulations on surfaces (Q5189238) (← links)
- $K_6$-Minors in Triangulations on the Klein Bottle (Q5189501) (← links)
- 6-Critical Graphs on the Klein Bottle (Q5189524) (← links)
- 2- and 3-factors of graphs on surfaces (Q5199420) (← links)
- Polylogarithmic approximation for Euler genus on bounded degree graphs (Q5212757) (← links)
- Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling (Q5232501) (← links)
- Polynomial Planar Directed Grid Theorem (Q5236273) (← links)
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (Q5259540) (← links)
- Embedding and canonizing graphs of bounded genus in logspace (Q5259572) (← links)
- Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes (Q5271050) (← links)
- Matching Extension Missing Vertices and Edges in Triangulations of Surfaces (Q5272644) (← links)
- Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs (Q5278404) (← links)
- N-Flips in even triangulations on surfaces (Q5300989) (← links)
- Six-Critical Graphs on the Klein Bottle (Q5301014) (← links)
