Hikoe Enomoto - RankMe

61 papers Journal 61

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