The following pages link to Hikoe Enomoto (Q186104):
Displayed 50 items.
- Disjoint shortest paths in graphs (Q762495) (← links)
- Independence number and vertex-disjoint cycles (Q878646) (← links)
- On component factors (Q1078207) (← links)
- Contractible edges in 3-connected graphs (Q1087557) (← links)
- Distance-regular digraphs of girth 4 (Q1101123) (← links)
- Toughness and the existence of k-factors. II (Q1106860) (← links)
- Factors and induced subgraphs (Q1120595) (← links)
- \(C_ k\)-factorization of complete bipartite graphs (Q1120596) (← links)
- Connected spanning subgraphs of 3-connected planar graphs (Q1125960) (← links)
- On maximal weights of Hadamard matrices (Q1145154) (← links)
- Combinatorially homogeneous graphs (Q1159700) (← links)
- A word problem in Artin semigroups (Q1196988) (← links)
- Tight 4-designs (Q1255003) (← links)
- Pyramidal tours with step-backs and the asymmetric traveling salesman problem (Q1270772) (← links)
- A note on difference sets (Q1273665) (← links)
- Neighborhood unions and factor critical graphs (Q1301846) (← links)
- Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph (Q1304472) (← links)
- Extremal 2-connected graphs with given diameter (Q1304925) (← links)
- On the existence of disjoint cycles in a graph (Q1307442) (← links)
- The Schur indices of the irreducible characters of \(G_ 2(2^ n)\) (Q1327783) (← links)
- Disjoint odd integer subsets having a constant even sum (Q1343783) (← links)
- The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint (Q1346794) (← links)
- Choice number of some complete multi-partite graphs (Q1349076) (← links)
- On the pagenumber of complete bipartite graphs (Q1386481) (← links)
- Graph decompositions without isolated vertices. II (Q1389861) (← links)
- Partition of a graph into cycles and degenerated cycles (Q1422422) (← links)
- Complete factors and \(f\)-factors (Q1567623) (← links)
- Toughness and the existence of \(k\)-factors. III (Q1584359) (← links)
- On the decomposition dimension of trees (Q1613499) (← links)
- The graph grabbing game on \(K_{m, n}\)-trees (Q1744738) (← links)
- Pure-strategy Nash equilibria on competitive diffusion games (Q1752579) (← links)
- Long cycles in triangle-free graphs with prescribed independence number and connectivity (Q1826952) (← links)
- Graph decompositions without isolated vertices (Q1892833) (← links)
- Graph decompositions and \(D_3\)-paths with a prescribed endvertex (Q1970703) (← links)
- Game chromatic number of strong product graphs (Q2092388) (← links)
- Strongly regular graphs and finite permutation groups of rank 3 (Q2549021) (← links)
- The characters of the finite symplectic group Sp(4,q), q=2\(^f\) (Q2558377) (← links)
- Ore-type degree condition for heavy paths in weighted graphs (Q2570107) (← links)
- Cyclic Chromatic Number of 3-Connected Plane Graphs (Q2706194) (← links)
- (Q2927932) (← links)
- (Q3011702) (← links)
- The independence number condition for the existence of a spanning f-tree (Q3069673) (← links)
- (Q3073553) (← links)
- (Q3211348) (← links)
- Long paths and large cycles in finite graphs (Q3333075) (← links)
- A general upper bound for the cyclic chromatic number of 3‐connected plane graphs (Q3652538) (← links)
- The linear arboricity of some regular graphs (Q3703914) (← links)
- Toughness and the existence ofk-factors (Q3731636) (← links)
- (Q3933005) (← links)
- (Q4075646) (← links)