The following pages link to Yoshio Sano (Q266799):
Displaying 50 items.
- On the competition graphs of \(d\)-partial orders (Q266800) (← links)
- A generalization of Opsut's lower bounds for the competition number of a graph (Q367054) (← links)
- Fat Hoffman graphs with smallest eigenvalue greater than \(-3\) (Q403567) (← links)
- The competition numbers of complete multipartite graphs with many partite sets (Q423931) (← links)
- The competition number of a graph and the dimension of its hole space (Q427694) (← links)
- On the smallest eigenvalues of the line graphs of some trees (Q472458) (← links)
- Edge-signed graphs with smallest eigenvalue greater than \(-2\) (Q473101) (← links)
- A generalization of Opsut's result on the competition numbers of line graphs (Q479034) (← links)
- The double competition hypergraph of a digraph (Q496443) (← links)
- Graphs having many holes but with small competition numbers (Q540279) (← links)
- The competition numbers of ternary Hamming graphs (Q548421) (← links)
- The non-bipartite integral graphs with spectral radius three (Q550638) (← links)
- Matroids on convex geometries: subclasses, operations, and optimization (Q638783) (← links)
- Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (Q723482) (← links)
- Matroids on convex geometries (cg-matroids) (Q882114) (← links)
- The competition graphs of oriented complete bipartite graphs (Q908307) (← links)
- Rank functions of strict cg-matroids (Q942102) (← links)
- Characterizations of competition multigraphs (Q967349) (← links)
- The competition number of a graph whose holes do not overlap much (Q987698) (← links)
- The competition numbers of complete tripartite graphs (Q1003747) (← links)
- The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares (Q1045184) (← links)
- T-neighbor systems and travel groupoids on a graph (Q1696539) (← links)
- The partial order competition dimensions of bipartite graphs (Q1720310) (← links)
- On the partial order competition dimensions of chordal graphs (Q1786874) (← links)
- Graph equation for line graphs and \(m\)-step graphs (Q1928288) (← links)
- On \(Q\)-integral graphs with edge-degrees at most six (Q2002711) (← links)
- On \(Q\)-integral graphs with \(Q\)-spectral radius 6 (Q2080256) (← links)
- Extended random assignment mechanisms on a family of good sets (Q2241324) (← links)
- On the minimum clique partitioning problem on weighted chordal graphs (Q2272395) (← links)
- Submodular optimization views on the random assignment problem (Q2330658) (← links)
- On the phylogeny graphs of degree-bounded digraphs (Q2410253) (← links)
- Competitively tight graphs (Q2441380) (← links)
- The competition number of the complement of a cycle (Q2446303) (← links)
- The competition hypergraphs of doubly partial orders (Q2448902) (← links)
- The niche graphs of interval orders (Q2450130) (← links)
- The principal numbers of K. Saito for the types \(A_{l}, D_{l}\) and \(E_{l}\) (Q2455588) (← links)
- On the hypercompetition numbers of hypergraphs with maximum degree at most two (Q2516687) (← links)
- Edge-disjoint Decompositions of Complete Multipartite Graphs into Gregarious Long Cycles (Q2864327) (← links)
- The Non-confusing Travel Groupoids on a Finite Connected Graph (Q2945660) (← links)
- The Double Multicompetition Number of a Multigraph (Q2945672) (← links)
- On the Competition Numbers of Diamond-Free Graphs (Q2958108) (← links)
- The competition numbers of Johnson graphs (Q2997604) (← links)
- The competition-common enemy graphs of digraphs satisfying Conditions $C(p)$ and $C'(p)$ (Q3015600) (← links)
- THE COMPETITION NUMBERS OF HAMMING GRAPHS WITH DIAMETER AT MOST THREE (Q3016157) (← links)
- (Q3114944) (← links)
- On the hypercompetition numbers of hypergraphs (Q3166443) (← links)
- Fat Hoffman graphs with smallest eigenvalue at least −1 − τ (Q3191460) (← links)
- (Q3467741) (← links)
- The competition numbers of regular polyhedra (Q3581914) (← links)
- Cycles and p-competition graphs (Q3581935) (← links)
