The following pages link to Atsushi Kaneko (Q226807):
Displayed 50 items.
- On spanning trees with restricted degrees (Q294729) (← links)
- Paths and cycles concerning independence edges (Q757417) (← links)
- Rainbow cycles in edge-colored graphs (Q906488) (← links)
- A rainbow \(k\)-matching in the complete graph with \(r\) colors (Q1028829) (← links)
- A mixed version of Menger's theorem (Q1180411) (← links)
- Item:Q226807 (redirect page) (← links)
- Straight-line embeddings of two rooted trees in the plane (Q1293679) (← links)
- A degree condition for the existence of 1-factors in graphs or their complements (Q1301648) (← links)
- The connectivities of leaf graphs of 2-connected graphs (Q1306305) (← links)
- On the number of acute triangles in a straight-line embedding of a maximal planar graph (Q1306427) (← links)
- The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint (Q1346794) (← links)
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two (Q1400955) (← links)
- Vertices of degree 6 in a contraction critically 6-connected graph (Q1417567) (← links)
- The connectivities of leaf graphs of sets of points in the plane (Q1598367) (← links)
- Vertices of degree 5 in a contraction critically 5-connected graph (Q1777238) (← links)
- Balanced partitions of two sets of points in the plane (Q1818118) (← links)
- Long cycles in triangle-free graphs with prescribed independence number and connectivity (Q1826952) (← links)
- On a 2-factor with a specified edge in a graph satisfying the Ore condition (Q1850026) (← links)
- On a Hamiltonian cycle in which specified vertices are not isolated (Q1850042) (← links)
- On geometric independency trees for points in the plane (Q1850043) (← links)
- On minimally \((n,\lambda)\)-connected graphs (Q1850492) (← links)
- On a Hamiltonian cycle in which specified vertices are uniformly distributed (Q1850512) (← links)
- Perfect partitions of convex sets in the plane (Q1864188) (← links)
- Edge-wide-diameter of graphs with diameter \(d\) (Q1865116) (← links)
- Cycles having the same modularity and removable edges in 2-connected graphs (Q1874350) (← links)
- The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\) (Q1916130) (← links)
- A remark on the connectivity of the complement of a 3-connected graph (Q1916372) (← links)
- Straight line embeddings of rooted star forests in the plane (Q1975369) (← links)
- Packing two copies of a tree into its third power (Q2433735) (← links)
- Contractible edges in minimally \(k\)-connected graphs (Q2467740) (← links)
- (Q2713617) (← links)
- (Q2725320) (← links)
- (Q2816110) (← links)
- (Q3211348) (← links)
- (Q3433933) (← links)
- Vertices of degree 6 in a 6-contraction critical graph (Q3438934) (← links)
- Spanning trees with leaf distance at least four (Q3445504) (← links)
- Cycles intersecting a prescribed vertex set (Q3984472) (← links)
- (Q4376499) (← links)
- A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition (Q4422614) (← links)
- (Q4504015) (← links)
- (Q4504022) (← links)
- (Q4514553) (← links)
- (Q4547804) (← links)
- (Q4547805) (← links)
- (Q4657582) (← links)
- Partitioning complete multipartite graphs by monochromatic trees (Q4667794) (← links)
- ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE (Q4682205) (← links)
- Relative length of long paths and cycles in graphs with large degree sums (Q4852406) (← links)
- Degree Sums and Covering Cycles (Q4857441) (← links)