default search action
Hikoe Enomoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j62]Hikoe Enomoto, Jun Fujisawa
, Naoki Matsumoto
Game chromatic number of strong product graphs. Discret. Math. 346(1): 113162 (2023)
2010 – 2019
- 2018
- [j61]Hikoe Enomoto, Masahiro Hachimori
Pure-strategy Nash equilibria on competitive diffusion games. Discret. Appl. Math. 244: 1-19 (2018) - [j60]Yoshimi Egawa, Hikoe Enomoto, Naoki Matsumoto
The graph grabbing game on Km, n-trees. Discret. Math. 341(6): 1555-1560 (2018) - 2017
- [j59]Guantao Chen, Hikoe Enomoto, Kenta Ozeki
Plane Triangulations Without a Spanning Halin Subgraph II. SIAM J. Discret. Math. 31(4): 2429-2439 (2017) - 2015
- [j58]Guantao Chen, Hikoe Enomoto, Kenta Ozeki
Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs. SIAM J. Discret. Math. 29(3): 1423-1426 (2015) - 2011
- [j57]Hikoe Enomoto, Yukichika Ohnishi, Katsuhiro Ota:
Spanning Trees with Bounded Total Excess. Ars Comb. 102: 289-295 (2011) - 2010
- [j56]Hikoe Enomoto, Kenta Ozeki
The independence number condition for the existence of a spanning f-tree. J. Graph Theory 65(3): 173-184 (2010)
2000 – 2009
- 2009
- [j55]Hikoe Enomoto, Jun Fujisawa:
Fan-type theorem for a long path passing through a specified vertex. Ars Comb. 90 (2009) - [j54]Hikoe Enomoto, Hajime Matsumura:
Cycle-Partitions with Specified Vertices and Edges. Ars Comb. 91 (2009) - [j53]Hikoe Enomoto, Mirko Hornák
A general upper bound for the cyclic chromatic number of 3-connected plane graphs. J. Graph Theory 62(1): 1-25 (2009) - 2007
- [j52]Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol'
Independence number and vertex-disjoint cycles. Discret. Math. 307(11-12): 1493-1498 (2007) - 2005
- [j51]Hikoe Enomoto, Jun Fujisawa, Katsuhiro Ota:
A sk type condition for heavy cycles in weighted graphs. Ars Comb. 76 (2005) - [j50]Hikoe Enomoto, Jun Fujisawa
Ore-type degree condition for heavy paths in weighted graphs. Discret. Math. 300(1-3): 100-109 (2005) - 2004
- [j49]Hikoe Enomoto, Hao Li:
Partition of a graph into cycles and degenerated cycles. Discret. Math. 276(1-3): 177-181 (2004) - [j48]Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei
Long cycles in triangle-free graphs with prescribed independence number and connectivity. J. Comb. Theory B 91(1): 43-55 (2004) - [j47]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): 145-166 (2004) - 2003
- [j46]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): 188-198 (2003) - 2002
- [j45]Yoshimi Egawa, Hikoe Enomoto, Norihide Tokushige:
Graph decompositions through prescribed vertices without isolates. Ars Comb. 62 (2002) - [j44]Hikoe Enomoto, Kyoji Ohba, Katsuhiro Ota, Junko Sakamoto:
Choice number of some complete multi-partite graphs. Discret. Math. 244(1-3): 55-66 (2002) - [j43]Hikoe Enomoto, Tomoki Nakamigawa:
On the decomposition dimension of trees. Discret. Math. 252(1-3): 219-225 (2002) - 2001
- [j42]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: 37-48 (2001) - [j41]Hikoe Enomoto, Gyula O. H. Katona:
Pairs of Disjoint q-element Subsets Far from Each Other. Electron. J. Comb. 8(2) (2001) - [j40]Hikoe Enomoto:
Graph partition problems into cycles and paths. Discret. Math. 233(1-3): 93-101 (2001) - [j39]Hikoe Enomoto, Mirko Hornák
Cyclic Chromatic Number of 3-Connected Plane Graphs. SIAM J. Discret. Math. 14(1): 121-137 (2001) - 2000
- [j38]Hikoe Enomoto, Kayo Masuda, Tomoki Nakamigawa:
Induced Graph Theorem on Magic Valuations. Ars Comb. 56 (2000) - [j37]Hikoe Enomoto, Shinsuke Matsunaga, Katsuhiro Ota:
Graph decompositions and D3-paths with a prescribed endvertex. Discret. Math. 213(1-3): 87-104 (2000) - [j36]Hikoe Enomoto, Mariko Hagita:
Toughness and the existence of k-factors. IV. Discret. Math. 216(1-3): 111-120 (2000) - [j35]Hikoe Enomoto, Taro Tokuda:
Complete-factors and f-factors. Discret. Math. 220(1-3): 239-242 (2000) - [j34]Hikoe Enomoto, Katsuhiro Ota:
Partitions of a graph into paths with prescribed endvertices and lengths. J. Graph Theory 34(2): 163-169 (2000)
1990 – 1999
- 1999
- [j33]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): 149-155 (1999) - [j32]Hikoe Enomoto, Michael D. Plummer, Akira Saito:
Neighborhood unions and factor critical graphs. Discret. Math. 205(1-3): 217-220 (1999) - [j31]Hikoe Enomoto, Katsuhiro Ota:
Connected subgraphs with small degree sums in 3-connected planar graphs. J. Graph Theory 30(3): 191-203 (1999) - [j30]Hikoe Enomoto, Miki Shimabara Miyauchi:
Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine. SIAM J. Discret. Math. 12(3): 337-341 (1999) - 1998
- [j29]Hikoe Enomoto:
On the Existence of Disjoint Cycles in a Graph. Comb. 18(4): 487-492 (1998) - [j28]Hikoe Enomoto, Yoshiaki Oda, Katsuhiro Ota:
Pyramidal Tours with Step-backs and the Asymmetric Traveling Salesman Problem. Discret. Appl. Math. 87(1-3): 57-65 (1998) - [j27]Hikoe Enomoto:
Toughness and the existence of k-factors. III. Discret. Math. 189(1-3): 277-282 (1998) - [j26]Hikoe Enomoto, Mariko Hagita, Makoto Matsumoto:
A Note on Difference Sets. J. Comb. Theory A 84(2): 133-144 (1998) - 1997
- [j25]Hikoe Enomoto, Tomoki Nakamigawa, Katsuhiro Ota:
On the Pagenumber of Complete Bipartite Graphs. J. Comb. Theory B 71(1): 111-120 (1997) - [j24]Hikoe Enomoto, Shinsuke Matsunaga:
Graph decompositions without isolated vertices III. J. Graph Theory 24(2): 155-164 (1997) - [j23]Hikoe Enomoto, Kazuhide Hirohata, Katsuhiro Ota:
Long cycles passing through a specified edge in a 3-connected graph. J. Graph Theory 24(3): 275-279 (1997) - 1996
- [j22]Hikoe Enomoto, Tadashi Iida, Katsuhiro Ota:
Connected Spanning Subgraphs of 3-Connected Planar Graphs. J. Comb. Theory, Ser. B 68(2): 314-323 (1996) - 1995
- [j21]Hikoe Enomoto, Mikio Kano:
Disjoint odd integer subsets having a constant even sum. Discret. Math. 137(1-3): 189-193 (1995) - [j20]Hikoe Enomoto:
Graph Decompositions without Isolated Vertices. J. Comb. Theory B 63(1): 111-124 (1995) - [j19]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): 213-225 (1995) - [j18]Hikoe Enomoto, Atsushi Kaneko, Mekkia Kouider, Zsolt Tuza:
Degree Sums and Covering Cycles. J. Graph Theory 20(4): 419-422 (1995) - 1992
- [j17]Hikoe Enomoto, Hajime Mizutani, Norihide Tokushige
A word problem in Artin semigroups. Discret. Math. 104(2): 159-166 (1992)
1980 – 1989
- 1988
- [j16]Yoshimi Egawa, Hikoe Enomoto, Akira Saito:
Factors and induced subgraphs. Discret. Math. 68(2-3): 179-189 (1988) - [j15]Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto:
Preface. Discret. Math. 72(1-3): 1-2 (1988) - [j14]Hikoe Enomoto, Takashi Miyamoto, Kazuhiko Ushio:
Ck-factorization of complete bipartite graphs. Graphs Comb. 4(1): 111-113 (1988) - [j13]Hikoe Enomoto, Katsuhiro Ota, Mikio Kano:
A sufficient condition for a bipartite graph to have a k-factor. J. Graph Theory 12(1): 141-151 (1988) - 1987
- [j12]Hikoe Enomoto, Peter Frankl, Noboru Ito, Kazumasa Nomura:
Codes with given distances. Graphs Comb. 3(1): 25-38 (1987) - [j11]Kiyoshi Ando, Hikoe Enomoto, Akira Saito:
Contractible edges in 3-connected graphs. J. Comb. Theory B 42(1): 87-93 (1987) - [j10]Hikoe Enomoto, R. A. Mena:
Distance-regular digraphs of girth 4. J. Comb. Theory B 43(3): 293-302 (1987) - 1986
- [j9]Yoshimi Egawa, Hikoe Enomoto, Akira Saito:
Contracible edges in triangle-free graphs. Comb. 6(3): 269-274 (1986) - [j8]Hikoe Enomoto:
Toughness and the existence ofk-factors. II. Graphs Comb. 2(1): 37-42 (1986) - [j7]Yoshimi Egawa, Hikoe Enomoto, Akira Saito:
On component factors. Graphs Comb. 2(1): 223-225 (1986) - 1985
- [j6]Hikoe Enomoto, Bill Jackson, P. Katerinis, Akira Saito:
Toughness and the existence of k-factors. J. Graph Theory 9(1): 87-95 (1985) - 1984
- [j5]Hikoe Enomoto, Akira Saito:
Disjoint shortest paths in graphs. Comb. 4(4): 275-279 (1984) - [j4]Hikoe Enomoto:
Long paths and large cycles in finite graphs. J. Graph Theory 8(2): 287-301 (1984) - [j3]Hikoe Enomoto, Bernard Péroche:
The linear arboricity of some regular graphs. J. Graph Theory 8(2): 309-324 (1984) - 1981
- [j2]Hikoe Enomoto:
Combinatorially homogeneous graphs. J. Comb. Theory B 30(2): 215-223 (1981) - 1980
- [j1]Hikoe Enomoto, Masahiko Miyamoto:
On Maximal Weights of Hadamard Matrices. J. Comb. Theory A 29(1): 94-100 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: