The following pages link to Ken-ichi Kawarabayashi (Q214979):
Displaying 50 items.
- Existence of two disjoint long cycles in graphs (Q2581410) (← links)
- Optimal distributed covering algorithms (Q2689837) (← links)
- Vertex-disjoint cycles containing specified edges in a bipartite graph (Q2712508) (← links)
- A note on Hamiltonian cycles in \((k,n)\)-factor-critical graphs (Q2716867) (← links)
- Note on \(k\)-contractible edges in \(k\)-connected graphs (Q2760438) (← links)
- A survey on Hamiltonian cycles (Q2780948) (← links)
- Relative length of longest path and longest cycle (Q2816111) (← links)
- Hadwiger's conjecture (Q2822591) (← links)
- Disjoint even cycles packing (Q2851449) (← links)
- Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree (Q2856138) (← links)
- High connectivity keeping connected subgraph (Q2857371) (← links)
- Hamilton cycles in 4-connected troidal triangulations (Q2857394) (← links)
- A shorter proof of the graph minor algorithm: the unique linkage theorem (Q2875195) (← links)
- Odd cycle packing (Q2875196) (← links)
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q2904762) (← links)
- Linear min-max relation between the treewidth of \(H\)-minor-free graphs and its largest grid (Q2904769) (← links)
- Minors in large almost-5-connected non-planar graphs (Q2911058) (← links)
- Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs (Q2931404) (← links)
- An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs (Q2933646) (← links)
- (Q2934714) (← links)
- The Directed Grid Theorem (Q2941561) (← links)
- Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (Q2941562) (← links)
- Beyond the Euler Characteristic (Q2941563) (← links)
- Coloring 3-colorable graphs with o(n 1/5 ) colors (Q2965508) (← links)
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (Q3012798) (← links)
- Star Coloring and Acyclic Coloring of Locally Planar Graphs (Q3084212) (← links)
- Immersing small complete graphs (Q3085021) (← links)
- (Q3112627) (← links)
- Generating Approximate Solutions to the TTP using a Linear Distance Relaxation (Q3143573) (← links)
- Coloring 3-Colorable Graphs with Less than <i>n</i> <sup>1/5</sup> Colors (Q3177885) (← links)
- Three-coloring triangle-free planar graphs in linear time (Q3189025) (← links)
- Graph Theory and Sports Scheduling (Q3193018) (← links)
- An Improved Algorithm for the Half-Disjoint Paths Problem (Q3225124) (← links)
- On Sufficient Degree Conditions for a Graph to be $k$-linked (Q3412102) (← links)
- (Q3433932) (← links)
- Vertices of degree 6 in a 6-contraction critical graph (Q3438934) (← links)
- Non-zero disjoint cycles in highly connected group labeled graphs (Q3439347) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- 5-Connected Toroidal Graphs are Hamiltonian-Connected (Q3462548) (← links)
- The Induced Disjoint Paths Problem (Q3503839) (← links)
- An Improved Algorithm for Finding Cycles Through Elements (Q3503860) (← links)
- Chvátal Erdős condition and 2-factors with a specyfied number of components (Q3504796) (← links)
- Contractible elements ink-connected graphs not containing some specified graphs (Q3506312) (← links)
- Approximating List-Coloring on a Fixed Surface (Q3521930) (← links)
- Nonseparating Induced Cycles Consisting of Contractible Edges in <i>k</i>-Connected Graphs (Q3544252) (← links)
- (Q3549636) (← links)
- (Q3549734) (← links)
- (Q3579485) (← links)
- An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs (Q3588414) (← links)
- Improved Algorithm for the Half-Disjoint Paths Problem (Q3588415) (← links)
