The following pages link to Katsuhiro Ota (Q214980):
Displaying 43 items.
- Maximal \(K_3\)'s and hamiltonicity of 4-connected claw-free graphs (Q2888878) (← links)
- Book embedding of toroidal bipartite graphs (Q2910942) (← links)
- Edge Proximity Conditions for Extendability in Planar Triangulations (Q2947852) (← links)
- Forbidden triples for perfect matchings (Q3018077) (← links)
- Long cycles passing through a specified edge in a 3-connected graph (Q3122902) (← links)
- The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity (Q3174237) (← links)
- (Q3433908) (← links)
- Chvátal Erdős condition and 2-factors with a specyfied number of components (Q3504796) (← links)
- Path factors in cubic graphs (Q3651178) (← links)
- Longest cycles in 3-connected graphs contain three contractible edges (Q3815326) (← links)
- Regular factors in <i>K</i><sub>1,<i>n</i></sub> free graphs (Q3978374) (← links)
- Non-separating induced cycles in 3-connected graphs (Q3990586) (← links)
- The 3‐connected graphs having a longest cycle containing only three contractible edges (Q4201392) (← links)
- Connected subgraphs with small degree sums in 3-connected planar graphs (Q4237728) (← links)
- (Q4273856) (← links)
- (Q4351466) (← links)
- Uniform Intersecting Families with Covering Number Restrictions (Q4383736) (← links)
- Vertex-disjoint cycles containing specified vertices in a bipartite graph (Q4474280) (← links)
- Partitions of a graph into paths with prescribed endvertices and lengths (Q4489491) (← links)
- Hamiltonian cycles in <i>n</i>‐extendable graphs (Q4539871) (← links)
- Vertex-Disjoint Stars in Graphs (Q4542866) (← links)
- (Q4649987) (← links)
- 2-connected 7-coverings of 3-connected graphs on surfaces (Q4808404) (← links)
- Note on irreducible triangulations of surfaces (Q4852407) (← links)
- A degree condition for the existence of regular factors inK1,n-free graphs (Q4879167) (← links)
- Forbidden Induced Subgraphs for Toughness (Q4920659) (← links)
- Disjoint Chorded Cycles of the Same Length (Q5256526) (← links)
- (Q5443216) (← links)
- (Q5461450) (← links)
- (Q5463576) (← links)
- (Q5487927) (← links)
- (Q5492586) (← links)
- (Q5500372) (← links)
- (Q5708603) (← links)
- (Q5708604) (← links)
- (Q5708626) (← links)
- A sufficient condition for a bipartite graph to have a <i>k</i>‐factor (Q5749320) (← links)
- Hamiltonian cycles in \(n\)-factor-critical graphs (Q5948969) (← links)
- Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs (Q6046653) (← links)
- Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two (Q6074584) (← links)
- Some conditions for Hamiltonian cycles in 1-tough \((K_2 \cup kK_1)\)-free graphs (Q6177437) (← links)
- New Invariants for Partitioning a Graph into 2-connected Subgraphs (Q6525915) (← links)
- Spanning plane subgraphs of $1$-plane graphs (Q6529645) (← links)
