The following pages link to Ken-ichi Kawarabayashi (Q214979):
Displaying 50 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- The Erdős-Lovász Tihany conjecture and complete minors (Q357460) (← links)
- Removable paths and cycles with parity constraints (Q402593) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- The Erdős-Pósa property for clique minors in highly connected graphs (Q412171) (← links)
- A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- A multi-round generalization of the traveling tournament problem and its application to Japanese baseball (Q421692) (← links)
- From the plane to higher surfaces (Q444375) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
- Spanning closed walks and TSP in 3-connected planar graphs (Q462924) (← links)
- Edge-colouring seven-regular planar graphs (Q491000) (← links)
- The edge density of critical digraphs (Q519953) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- The 2-extendability of 5-connected graphs on surfaces with large representativity (Q536645) (← links)
- Toughness of \(K_{a,t}\)-minor-free graphs (Q554002) (← links)
- Contractible small subgraphs in \(k\)-connected graphs (Q604980) (← links)
- Non-separating subgraphs after deleting many disjoint paths (Q618034) (← links)
- (Q653834) (redirect page) (← links)
- Non-separating even cycles in highly connected graphs (Q653835) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- Minimally contraction-critically 6-connected graphs (Q658121) (← links)
- Contractible triples in highly connected graphs (Q659608) (← links)
- \(K_{6}\) minors in large 6-connected graphs (Q684126) (← links)
- A new proof of the flat wall theorem (Q684127) (← links)
- A note on traversing specified vertices in graphs embedded with large representativity (Q709309) (← links)
- A simpler proof for the two disjoint odd cycles theorem (Q744153) (← links)
- Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture (Q744154) (← links)
- Chords of longest circuits in locally planar graphs (Q854834) (← links)
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture (Q858685) (← links)
- The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces (Q868342) (← links)
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs (Q875943) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- A relaxed Hadwiger's conjecture for list colorings (Q885300) (← links)
- Packing six \(T\)-joins in plane graphs (Q896004) (← links)
- Non-separating subgraphs in highly connected graphs (Q905893) (← links)
- Connectivity keeping edges in graphs with large minimum degree (Q933682) (← links)
- A weaker version of Lovász' path removal conjecture (Q947724) (← links)
- Some remarks on the odd Hadwiger's conjecture (Q950324) (← links)
- Locally planar graphs are 5-choosable (Q958683) (← links)
- A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757) (← links)
- Double-critical graphs and complete minors (Q976747) (← links)
- Highly parity linked graphs (Q987554) (← links)
- Long cycles in graphs without Hamiltonian paths (Q998320) (← links)
- Note on non-separating and removable cycles in highly connected graphs (Q1003687) (← links)
- Linear connectivity forces large complete bipartite minors: [J. Combin. Theory ser. B vol. 99, issue 2] (Q1003835) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
