佐野 良夫(サノ ヨシオ)
- 論文
- The non-confusing travel groupoids on a finite connected graph
CHO Jung Rae; PARK Jeongmi; SANO Yoshio
Lecture Notes in Computer Science/8845/pp.14-17, 2014-12 - The double multicompetition number of a multigraph
PARK Jeongmi; SANO Yoshio
Lecture Notes in Computer Science/8845/pp.138-144, 2014-12 - Fat Hoffman graphs with smallest eigenvalue greater than -3
MUNEMASA Akihiro; SANO Yoshio; TANIGUCHI Tetsuji
Discrete Applied Mathematics/176/pp.78-88, 2014-10 - Travel groupoids on infinite graphs
CHO Jung Rae; PARK Jeongmi; SANO Yoshio
Czechoslovak Mathematical Journal/64(3)/pp.763-766, 2014-09 - The niche graphs of interval orders
PARK Jeongmi; SANO Yoshio
Discussiones Mathematicae Graph Theory/34(2)/pp.353-359, 2014-04 - The competition hypergraphs of doubly partial orders
KIM Suh-Ryung; LEE Jung Yeun; PARK Boram; SANO Yoshio
Discrete Applied Mathematics/165(-)/pp.185-191, 2014-03 - Fat Hoffman graphs with smallest eigenvalue at least
MUNEMASA Akihiro; SANO Yoshio; TANIGUCHI Tetsuji
Ars Mathematica Contemporanea/7(1)/pp.247-262, 2014-01 - Edge-disjoint decompositions of complete multipartite graphs into gregarious long cycles
CHO Jung Rae; PARK Jeongmi; SANO Yoshio
Lecture Notes in Computer Science/8296(-)/pp.57-63, 2013-12 - Competitively tight graphs
KIM Suh-Ryung; LEE Jung Yeun; PARK Boram; SANO Yoshio
Annals of Combinatorics/17(4)/pp.733-741, 2013-11 - The phylogeny graphs of doubly partial orders
PARK Boram; SANO Yoshio
Discussiones Mathematicae Graph Theory/33(4)/pp.657-664, 2013-10 - A generalization of Opsut's lower bounds for the competition number of a graph
SANO Yoshio
Graphs and Combinatorics/29(5)/pp.1543-1547, 2013-09 - The competition number of the complement of a cycle
KIM Suh-Ryung; PARK Boram; SANO Yoshio
Discrete Applied Mathematics/161(12)/pp.1755-1760, 2013-08 - Graph equation for line graphs and
-step graphs
KIM Seog-Jin; KIM Suh-Ryung; LEE Jung Yeun; PARK Won Jin; SAN...
Graphs and Combinatorics/28(6)/pp.831-842, 2012-11 - The competition number of a generalized line graph is at most two
PARK Boram; SANO Yoshio
Discrete Mathematics & Theoretical Computer Science/14(2)/pp.1-10, 2012-08 - The competition numbers of complete multipartite graphs with many partite sets
KIM Suh-Ryung; PARK Boram; SANO Yoshio
Discrete Applied Mathematics/160(7-8)/pp.1176-1182, 2012-05 - The competition number of a graph and the dimension of its hole space
KIM Suh-Ryung; LEE Jung Yeun; PARK Boram; SANO Yoshio
Applied Mathematics Letters/25(3)/pp.638-642, 2012-03 - The non-bipartite integral graphs with spectral radius three
CHUNG Taeyoung; KOOLEN Jack; SANO Yoshio; TANIGUCHI Tetsuji
Linear Algebra and its Applications/435(10)/pp.2544-2559, 2011-11 - The competition numbers of ternary Hamming graphs
PARK Boram; SANO Yoshio
Applied Mathematics Letters/24(9)/pp.1608-1613, 2011-09 - Graphs having many holes but with small competition numbers
LEE Jung Yeun; KIM Suh-Ryung; KIM Seog-Jin; SANO Yoshio
Applied Mathematics Letters/24(8)/pp.1331-1335, 2011-08 - Matroids on convex geometries: Subclasses, operations, and optimization
SANO Yoshio
Publications of the Research Institute for Mathematical Sciences/47(3)/pp.671-703, 2011-08 - On the hypercompetition numbers of hypergraphs
PARK Boram; SANO Yoshio
Ars Combinatoria/100(-)/pp.151-159, 2011-07 - The competition numbers of Hamming graphs with diameter at most three
PARK Boram; SANO Yoshio
Journal of the Korean Mathematical Society/48(4)/pp.691-702, 2011-07 - The competition-common enemy graphs of digraphs satisfying Conditions
and
SANO Yoshio
Congressus Numerantium/202 (-)/pp.187-194, 2010-12 - The competition numbers of Johnson graphs
KIM Suh-Ryung; PARK Boram; SANO Yoshio
Discussiones Mathematicae Graph Theory/30(3)/pp.449-459, 2010-10 - The competition number of a graph whose holes do not overlap much
KIM Suh-Ryung; LEE Jung Yeun; SANO Yoshio
Discrete Applied Mathematics/158(13)/pp.1456-1460, 2010-07 - さらに表示...
- The non-confusing travel groupoids on a finite connected graph