Hikoe Enomoto

According to our database, Hikoe Enomoto authored at least 62 papers between 1980 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Game chromatic number of strong product graphs.

Hikoe Enomoto, Jun Fujisawa, Naoki Matsumoto

Discret. Math., 2023

2018

The graph grabbing game on Km, n-trees.

Yoshimi Egawa, Hikoe Enomoto, Naoki Matsumoto

Discret. Math., 2018

Pure-strategy Nash equilibria on competitive diffusion games.

Hikoe Enomoto, Masahiro Hachimori, Shun Nakamura, Maiko Shigeno, Yuya Tanaka, Masaaki Tsugami

Discret. Appl. Math., 2018

2017

Plane Triangulations Without a Spanning Halin Subgraph II.

Guantao Chen, Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya

SIAM J. Discret. Math., 2017

2015

Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs.

Guantao Chen, Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya

SIAM J. Discret. Math., 2015

2011

Spanning Trees with Bounded Total Excess.

Hikoe Enomoto, Yukichika Ohnishi, Katsuhiro Ota

Ars Comb., 2011

2010

The independence number condition for the existence of a spanning <i>f</i>-tree.

Hikoe Enomoto, Kenta Ozeki

J. Graph Theory, 2010

2009

A general upper bound for the cyclic chromatic number of 3-connected plane graphs.

Hikoe Enomoto, Mirko Hornák

J. Graph Theory, 2009

Cycle-Partitions with Specified Vertices and Edges.

Hikoe Enomoto, Hajime Matsumura

Ars Comb., 2009

Fan-type theorem for a long path passing through a specified vertex.

Hikoe Enomoto, Jun Fujisawa

Ars Comb., 2009

2007

Independence number and vertex-disjoint cycles.

Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol', Katsuhiro Ota, Ingo Schiermeyer

Discret. Math., 2007

2005

Ore-type degree condition for heavy paths in weighted graphs.

Hikoe Enomoto, Jun Fujisawa, Katsuhiro Ota

Discret. Math., 2005

A sk type condition for heavy cycles in weighted graphs.

Hikoe Enomoto, Jun Fujisawa, Katsuhiro Ota

Ars Comb., 2005

2004

Vertex-disjoint cycles containing specified vertices in a bipartite graph.

Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito

J. Graph Theory, 2004

Long cycles in triangle-free graphs with prescribed independence number and connectivity.

Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei

J. Comb. Theory, Ser. B, 2004

Partition of a graph into cycles and degenerated cycles.

Hikoe Enomoto, Hao Li

Discret. Math., 2004

2003

Two-factors each component of which contains a specified vertex.

Yoshimi Egawa, Hikoe Enomoto, Ralph J. Faudree, Hao Li, Ingo Schiermeyer

J. Graph Theory, 2003

2002

Choice number of some complete multi-partite graphs.

Hikoe Enomoto, Kyoji Ohba, Katsuhiro Ota, Junko Sakamoto

Discret. Math., 2002

On the decomposition dimension of trees.

Hikoe Enomoto, Tomoki Nakamigawa

Discret. Math., 2002

Graph decompositions through prescribed vertices without isolates.

Yoshimi Egawa, Hikoe Enomoto, Norihide Tokushige

Ars Comb., 2002

2001

Cyclic Chromatic Number of 3-Connected Plane Graphs.

Hikoe Enomoto, Mirko Hornák, Stanislav Jendrol'

SIAM J. Discret. Math., 2001

Graph partition problems into cycles and paths.

Hikoe Enomoto

Discret. Math., 2001

Pairs of Disjoint q-element Subsets Far from Each Other.

Hikoe Enomoto, Gyula O. H. Katona

Electron. J. Comb., 2001

Vertex-disjoint cycles containing specified edges in a bipartite graph.

Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito

Australas. J Comb., 2001

2000

Partitions of a graph into paths with prescribed endvertices and lengths.

Hikoe Enomoto, Katsuhiro Ota

J. Graph Theory, 2000

Complete-factors and <i>f</i>-factors.

Hikoe Enomoto, Taro Tokuda

Discret. Math., 2000

Graph decompositions and <i>D</i>₃-paths with a prescribed endvertex.

Hikoe Enomoto, Shinsuke Matsunaga, Katsuhiro Ota

Discret. Math., 2000

Toughness and the existence of <i>k</i>-factors. IV.

Hikoe Enomoto, Mariko Hagita

Discret. Math., 2000

Induced Graph Theorem on Magic Valuations.

Hikoe Enomoto, Kayo Masuda, Tomoki Nakamigawa

Ars Comb., 2000

1999

Embedding Graphs into a Three Page Book with <i>O</i>(<i>m</i> log <i>n</i>) Crossings of Edges over the Spine.

Hikoe Enomoto, Miki Shimabara Miyauchi

SIAM J. Discret. Math., 1999

Connected subgraphs with small degree sums in 3-connected planar graphs.

Hikoe Enomoto, Katsuhiro Ota

J. Graph Theory, 1999

Neighborhood unions and factor critical graphs.

Hikoe Enomoto, Michael D. Plummer, Akira Saito

Discret. Math., 1999

Lower Bounds for the Number of Edge-crossings Over the Spine in a Topological Book Embedding of a Graph.

Hikoe Enomoto, Miki Shimabara Miyauchi, Katsuhiro Ota

Discret. Appl. Math., 1999

1998

A Note on Difference Sets.

Hikoe Enomoto, Mariko Hagita, Makoto Matsumoto

J. Comb. Theory, Ser. A, 1998

Toughness and the existence of k-factors. III.

Hikoe Enomoto

Discret. Math., 1998

Pyramidal Tours with Step-backs and the Asymmetric Traveling Salesman Problem.

Hikoe Enomoto, Yoshiaki Oda, Katsuhiro Ota

Discret. Appl. Math., 1998

On the Existence of Disjoint Cycles in a Graph.

Hikoe Enomoto

Comb., 1998

1997

Graph decompositions without isolated vertices III.

Hikoe Enomoto, Shinsuke Matsunaga

J. Graph Theory, 1997

Long cycles passing through a specified edge in a 3-connected graph.

Hikoe Enomoto, Kazuhide Hirohata, Katsuhiro Ota

J. Graph Theory, 1997

On the Pagenumber of Complete Bipartite Graphs.

Hikoe Enomoto, Tomoki Nakamigawa, Katsuhiro Ota

J. Comb. Theory, Ser. B, 1997

1996

Connected Spanning Subgraphs of 3-Connected Planar Graphs.

Hikoe Enomoto, Tadashi Iida, Katsuhiro Ota

J. Comb. Theory, Ser. B, 1996

1995

Degree Sums and Covering Cycles.

Hikoe Enomoto, Atsushi Kaneko, Mekkia Kouider, Zsolt Tuza

J. Graph Theory, 1995

Relative length of long paths and cycles in graphs with large degree sums.

Hikoe Enomoto, Jan van den Heuvel, Atsushi Kaneko, Akira Saito

J. Graph Theory, 1995

Graph Decompositions without Isolated Vertices.

Hikoe Enomoto

J. Comb. Theory, Ser. B, 1995

Disjoint odd integer subsets having a constant even sum.

Hikoe Enomoto, Mikio Kano

Discret. Math., 1995

1992

A word problem in Artin semigroups.

Hikoe Enomoto, Hajime Mizutani, Norihide Tokushige

Discret. Math., 1992

1988

A sufficient condition for a bipartite graph to have a <i>k</i>-factor.

Hikoe Enomoto, Katsuhiro Ota, Mikio Kano

J. Graph Theory, 1988

<i>C</i>_<i>k</i>-factorization of complete bipartite graphs.

Hikoe Enomoto, Takashi Miyamoto, Kazuhiko Ushio

Graphs Comb., 1988

Factors and induced subgraphs.

Yoshimi Egawa, Hikoe Enomoto, Akira Saito

Discret. Math., 1988

Preface.

Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto

Discret. Math., 1988

1987

Distance-regular digraphs of girth 4.

Hikoe Enomoto, R. A. Mena

J. Comb. Theory, Ser. B, 1987

Contractible edges in 3-connected graphs.

Kiyoshi Ando, Hikoe Enomoto, Akira Saito

J. Comb. Theory, Ser. B, 1987

Codes with given distances.

Hikoe Enomoto, Peter Frankl, Noboru Ito, Kazumasa Nomura

Graphs Comb., 1987

1986

Toughness and the existence of<i>k</i>-factors. II.

Hikoe Enomoto

Graphs Comb., 1986

On component factors.

Yoshimi Egawa, Hikoe Enomoto, Akira Saito

Graphs Comb., 1986

Contracible edges in triangle-free graphs.

Yoshimi Egawa, Hikoe Enomoto, Akira Saito

Comb., 1986

1985

Toughness and the existence of <i>k</i>-factors.

Hikoe Enomoto, Bill Jackson, P. Katerinis, Akira Saito

J. Graph Theory, 1985

1984

The linear arboricity of some regular graphs.

Hikoe Enomoto, Bernard Péroche

J. Graph Theory, 1984

Long paths and large cycles in finite graphs.

Hikoe Enomoto

J. Graph Theory, 1984

Disjoint shortest paths in graphs.

Hikoe Enomoto, Akira Saito

Comb., 1984

1981

Combinatorially homogeneous graphs.

Hikoe Enomoto

J. Comb. Theory, Ser. B, 1981

1980

On Maximal Weights of Hadamard Matrices.

Hikoe Enomoto, Masahiko Miyamoto

J. Comb. Theory, Ser. A, 1980