Hikoe Enomoto

Publication Activity (10 Years)

Years Active: 1980-2023
Publications (10 Years): 5

Top Topics

Frequent Subgraph Mining

Graph Theoretic

Nash Equilibria

Top Venues

SIAM J. Discret. Math.

Discret. Appl. Math.

Publications

Hikoe Enomoto, Jun Fujisawa, Naoki Matsumoto
Game chromatic number of strong product graphs. Discret. Math. 346 (1) (2023)
Yoshimi Egawa, Hikoe Enomoto, Naoki Matsumoto
The graph grabbing game on Km, n-trees. Discret. Math. 341 (6) (2018)
Hikoe Enomoto, Masahiro Hachimori, Shun Nakamura, Maiko Shigeno, Yuya Tanaka, Masaaki Tsugami
Pure-strategy Nash equilibria on competitive diffusion games. Discret. Appl. Math. 244 (2018)
Guantao Chen, Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya
Plane Triangulations Without a Spanning Halin Subgraph II. SIAM J. Discret. Math. 31 (4) (2017)
Guantao Chen, Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya
Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs. SIAM J. Discret. Math. 29 (3) (2015)
Hikoe Enomoto, Yukichika Ohnishi, Katsuhiro Ota
Spanning Trees with Bounded Total Excess. Ars Comb. 102 (2011)
Hikoe Enomoto, Kenta Ozeki
-tree. J. Graph Theory 65 (3) (2010)
Hikoe Enomoto, Jun Fujisawa
Fan-type theorem for a long path passing through a specified vertex. Ars Comb. 90 (2009)
Hikoe Enomoto, Mirko Hornák
A general upper bound for the cyclic chromatic number of 3-connected plane graphs. J. Graph Theory 62 (1) (2009)
Hikoe Enomoto, Hajime Matsumura
Cycle-Partitions with Specified Vertices and Edges. Ars Comb. 91 (2009)
Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol', Katsuhiro Ota, Ingo Schiermeyer
Independence number and vertex-disjoint cycles. Discret. Math. 307 (11-12) (2007)
Hikoe Enomoto, Jun Fujisawa, Katsuhiro Ota
A sk type condition for heavy cycles in weighted graphs. Ars Comb. 76 (2005)
Hikoe Enomoto, Jun Fujisawa, Katsuhiro Ota
Ore-type degree condition for heavy paths in weighted graphs. Discret. Math. 300 (1-3) (2005)
Hikoe Enomoto, Hao Li
Partition of a graph into cycles and degenerated cycles. Discret. Math. 276 (1-3) (2004)
Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito
Vertex-disjoint cycles containing specified vertices in a bipartite graph. J. Graph Theory 46 (3) (2004)
Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei
Long cycles in triangle-free graphs with prescribed independence number and connectivity. J. Comb. Theory, Ser. B 91 (1) (2004)
Yoshimi Egawa, Hikoe Enomoto, Ralph J. Faudree, Hao Li, Ingo Schiermeyer
Two-factors each component of which contains a specified vertex. J. Graph Theory 43 (3) (2003)
Yoshimi Egawa, Hikoe Enomoto, Norihide Tokushige
Graph decompositions through prescribed vertices without isolates. Ars Comb. 62 (2002)
Hikoe Enomoto, Tomoki Nakamigawa
On the decomposition dimension of trees. Discret. Math. 252 (1-3) (2002)
Hikoe Enomoto, Kyoji Ohba, Katsuhiro Ota, Junko Sakamoto
Choice number of some complete multi-partite graphs. Discret. Math. 244 (1-3) (2002)
Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito
Vertex-disjoint cycles containing specified edges in a bipartite graph. Australas. J Comb. 23 (2001)
Hikoe Enomoto, Gyula O. H. Katona
Pairs of Disjoint q-element Subsets Far from Each Other. Electron. J. Comb. 8 (2) (2001)
Hikoe Enomoto
Graph partition problems into cycles and paths. Discret. Math. 233 (1-3) (2001)
Hikoe Enomoto, Mirko Hornák, Stanislav Jendrol'
Cyclic Chromatic Number of 3-Connected Plane Graphs. SIAM J. Discret. Math. 14 (1) (2001)
Hikoe Enomoto, Taro Tokuda
-factors. Discret. Math. 220 (1-3) (2000)
Hikoe Enomoto, Katsuhiro Ota
Partitions of a graph into paths with prescribed endvertices and lengths. J. Graph Theory 34 (2) (2000)
Hikoe Enomoto, Shinsuke Matsunaga, Katsuhiro Ota
-paths with a prescribed endvertex. Discret. Math. 213 (1-3) (2000)
Hikoe Enomoto, Kayo Masuda, Tomoki Nakamigawa
Induced Graph Theorem on Magic Valuations. Ars Comb. 56 (2000)
Hikoe Enomoto, Mariko Hagita
-factors. IV. Discret. Math. 216 (1-3) (2000)
Hikoe Enomoto, Miki Shimabara Miyauchi, Katsuhiro Ota
Lower Bounds for the Number of Edge-crossings Over the Spine in a Topological Book Embedding of a Graph. Discret. Appl. Math. 92 (2-3) (1999)
Hikoe Enomoto, Katsuhiro Ota
Connected subgraphs with small degree sums in 3-connected planar graphs. J. Graph Theory 30 (3) (1999)
Hikoe Enomoto, Michael D. Plummer, Akira Saito
Neighborhood unions and factor critical graphs. Discret. Math. 205 (1-3) (1999)
Hikoe Enomoto, Miki Shimabara Miyauchi
) Crossings of Edges over the Spine. SIAM J. Discret. Math. 12 (3) (1999)
Hikoe Enomoto
On the Existence of Disjoint Cycles in a Graph. Comb. 18 (4) (1998)
Hikoe Enomoto, Mariko Hagita, Makoto Matsumoto
A Note on Difference Sets. J. Comb. Theory, Ser. A 84 (2) (1998)
Hikoe Enomoto, Yoshiaki Oda, Katsuhiro Ota
Pyramidal Tours with Step-backs and the Asymmetric Traveling Salesman Problem. Discret. Appl. Math. 87 (1-3) (1998)
Hikoe Enomoto
Toughness and the existence of k-factors. III. Discret. Math. 189 (1-3) (1998)
Hikoe Enomoto, Tomoki Nakamigawa, Katsuhiro Ota
On the Pagenumber of Complete Bipartite Graphs. J. Comb. Theory, Ser. B 71 (1) (1997)
Hikoe Enomoto, Shinsuke Matsunaga
Graph decompositions without isolated vertices III. J. Graph Theory 24 (2) (1997)
Hikoe Enomoto, Kazuhide Hirohata, Katsuhiro Ota
Long cycles passing through a specified edge in a 3-connected graph. J. Graph Theory 24 (3) (1997)
Hikoe Enomoto, Tadashi Iida, Katsuhiro Ota
Connected Spanning Subgraphs of 3-Connected Planar Graphs. J. Comb. Theory, Ser. B 68 (2) (1996)
Hikoe Enomoto
Graph Decompositions without Isolated Vertices. J. Comb. Theory, Ser. B 63 (1) (1995)
Hikoe Enomoto, Mikio Kano
Disjoint odd integer subsets having a constant even sum. Discret. Math. 137 (1-3) (1995)
Hikoe Enomoto, Atsushi Kaneko, Mekkia Kouider, Zsolt Tuza
Degree Sums and Covering Cycles. J. Graph Theory 20 (4) (1995)
Hikoe Enomoto, Jan van den Heuvel, Atsushi Kaneko, Akira Saito
Relative length of long paths and cycles in graphs with large degree sums. J. Graph Theory 20 (2) (1995)
Hikoe Enomoto, Hajime Mizutani, Norihide Tokushige
A word problem in Artin semigroups. Discret. Math. 104 (2) (1992)
Hikoe Enomoto, Takashi Miyamoto, Kazuhiko Ushio
-factorization of complete bipartite graphs. Graphs Comb. 4 (1) (1988)
Yoshimi Egawa, Hikoe Enomoto, Akira Saito
Factors and induced subgraphs. Discret. Math. 68 (2-3) (1988)
Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto
Preface. Discret. Math. 72 (1-3) (1988)
Hikoe Enomoto, Katsuhiro Ota, Mikio Kano
-factor. J. Graph Theory 12 (1) (1988)
Hikoe Enomoto, R. A. Mena
Distance-regular digraphs of girth 4. J. Comb. Theory, Ser. B 43 (3) (1987)
Kiyoshi Ando, Hikoe Enomoto, Akira Saito
Contractible edges in 3-connected graphs. J. Comb. Theory, Ser. B 42 (1) (1987)
Hikoe Enomoto, Peter Frankl, Noboru Ito, Kazumasa Nomura
Codes with given distances. Graphs Comb. 3 (1) (1987)
Hikoe Enomoto
-factors. II. Graphs Comb. 2 (1) (1986)
Yoshimi Egawa, Hikoe Enomoto, Akira Saito
On component factors. Graphs Comb. 2 (1) (1986)
Yoshimi Egawa, Hikoe Enomoto, Akira Saito
Contracible edges in triangle-free graphs. Comb. 6 (3) (1986)
Hikoe Enomoto, Bill Jackson, P. Katerinis, Akira Saito
-factors. J. Graph Theory 9 (1) (1985)
Hikoe Enomoto, Akira Saito
Disjoint shortest paths in graphs. Comb. 4 (4) (1984)
Hikoe Enomoto
Long paths and large cycles in finite graphs. J. Graph Theory 8 (2) (1984)
Hikoe Enomoto, Bernard Péroche
The linear arboricity of some regular graphs. J. Graph Theory 8 (2) (1984)
Hikoe Enomoto
Combinatorially homogeneous graphs. J. Comb. Theory, Ser. B 30 (2) (1981)
Hikoe Enomoto, Masahiko Miyamoto
On Maximal Weights of Hadamard Matrices. J. Comb. Theory, Ser. A 29 (1) (1980)