default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomoki Nakamigawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j34]Yoshiaki Doi, Norio Konno, Tomoki Nakamigawa, Tadashi Sakuma
, Etsuo Segawa, Hidehiro Shinohara, Shunya Tamura, Yuuho Tanaka, Kosuke Toyota:
On the average hitting times of the squares of cycles. Discret. Appl. Math. 313: 18-28 (2022)- 2021
- [j33]Naoki Matsumoto, Tomoki Nakamigawa:
Game edge-connectivity of graphs. Discret. Appl. Math. 298: 155-164 (2021) - [j32]Tatsuoki Kato, Tomoki Nakamigawa, Tadashi Sakuma:
Pebble exchange group of graphs. Eur. J. Comb. 95: 103325 (2021) - 2020
- [j31]Tomoki Nakamigawa:
The expansion of a chord diagram and the Genocchi numbers. Ars Math. Contemp. 18(2): 381-391 (2020) - [j30]Naoki Matsumoto, Tomoki Nakamigawa:
Game connectivity of graphs. Discret. Math. 343(11): 112104 (2020) - [j29]Naoki Matsumoto, Tomoki Nakamigawa, Tadashi Sakuma:
Convex Grabbing Game of the Point Set on the Plane. Graphs Comb. 36(1): 51-62 (2020)
2010 – 2019
- 2019
- [i1]Tatsuoki Kato, Tomoki Nakamigawa, Tadashi Sakuma:
Pebble Exchange Group of Graphs. CoRR abs/1904.00402 (2019) - 2018
- [j28]Tomoki Nakamigawa, Tadashi Sakuma:
The expansion of a chord diagram and the Tutte polynomial. Discret. Math. 341(6): 1573-1581 (2018) - 2017
- [j27]Tomoki Nakamigawa, Tadashi Sakuma:
The Expansion of a Chord Diagram and the Tutte Polynomial. Electron. Notes Discret. Math. 61: 917-923 (2017) - 2016
- [j26]Tomoki Nakamigawa:
Expansions of a Chord Diagram and Alternating Permutations. Electron. J. Comb. 23(1): 1 (2016) - [j25]Tomoki Nakamigawa:
An extremal problem for vertex partition of complete multipartite graphs. Discret. Math. 339(6): 1699-1705 (2016) - [j24]Tomoki Nakamigawa:
Enumeration Problems on the Expansion of a Chord Diagram. Electron. Notes Discret. Math. 54: 51-56 (2016) - 2015
- [j23]Tomoki Nakamigawa:
Partitioning a cyclic group into well-dispersed subsets with a common gap sequence. Australas. J Comb. 61: 281- (2015) - [j22]Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma:
Pebble exchange on graphs. Discret. Appl. Math. 184: 139-145 (2015) - 2014
- [j21]Tomoki Nakamigawa:
A Ramsey-type theorem for multiple disjoint copies of induced subgraphs. Discuss. Math. Graph Theory 34(2): 249-261 (2014) - 2013
- [j20]Tomoki Nakamigawa:
A Ramsey-type Theorem for Multiple Disjoint Copies of Induced Subgraphs (Extended Abstract). Electron. Notes Discret. Math. 43: 97-102 (2013) - 2012
- [j19]Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma:
Colored pebble motion on graphs. Eur. J. Comb. 33(5): 884-892 (2012) - [j18]Tomoki Nakamigawa, Norihide Tokushige:
Counting Lattice Paths via a New Cycle Lemma. SIAM J. Discret. Math. 26(2): 745-754 (2012) - [j17]Toshinori Takabatake, Tomoki Nakamigawa:
Node-disjoint paths in a level block of generalized hierarchical completely connected networks. Theor. Comput. Sci. 465: 28-34 (2012) - 2011
- [j16]Tomoki Nakamigawa, Norihide Tokushige:
Counting lattice paths via a cycle lemma. Electron. Notes Discret. Math. 38: 675-680 (2011) - 2010
- [j15]Tomoki Nakamigawa:
Vertex partition of a complete multipartite graph into two kinds of induced subgraphs. Discret. Math. 310(13-14): 1898-1911 (2010)
2000 – 2009
- 2009
- [j14]Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma:
Colored Pebble Motion on Graphs (Extended Abstract). Electron. Notes Discret. Math. 34: 185-189 (2009) - 2008
- [j13]Shinya Fujita, Tomoki Nakamigawa:
Balanced decomposition of a vertex-colored graph. Discret. Appl. Math. 156(18): 3339-3344 (2008) - [j12]Tomoki Nakamigawa:
Equivalent subsets of a colored set. Eur. J. Comb. 29(7): 1782-1799 (2008) - [j11]Toshinori Takabatake, Tomoki Nakamigawa, Hideo Ito:
Connectivity of Generalized Hierarchical Completely-Connected Networks. J. Interconnect. Networks 9(1/2): 127-139 (2008) - 2007
- [j10]Tomoki Nakamigawa:
Vertex disjoint equivalent subgraphs of order 3. J. Graph Theory 56(3): 159-166 (2007) - 2005
- [j9]Tomoki Nakamigawa:
One-dimensional Tilings Using Tiles with Two Gap Lengths. Graphs Comb. 21(1): 97-105 (2005) - 2004
- [j8]Tomoki Nakamigawa, Mamoru Watanabe:
Separating pairs of points in the plane by monotone subsequences. Australas. J Comb. 30: 223-228 (2004) - 2003
- [j7]Tomoki Nakamigawa:
A Note on the Decomposition Dimension of Complete Graphs. Ars Comb. 69 (2003) - [j6]Tomoki Nakamigawa:
A partition problem on colored sets. Discret. Math. 265(1-3): 405-410 (2003) - 2002
- [j5]Hikoe Enomoto, Tomoki Nakamigawa:
On the decomposition dimension of trees. Discret. Math. 252(1-3): 219-225 (2002) - 2001
- [j4]Tomoki Nakamigawa:
Nakade -- a graph theoretic concept in Go. Discret. Math. 235(1-3): 385-397 (2001) - 2000
- [j3]Hikoe Enomoto, Kayo Masuda, Tomoki Nakamigawa:
Induced Graph Theorem on Magic Valuations. Ars Comb. 56 (2000) - [j2]Tomoki Nakamigawa:
A generalization of diagonal flips in a convex polygon. Theor. Comput. Sci. 235(2): 271-282 (2000)
1990 – 1999
- 1998
- [c1]Tomoki Nakamigawa:
One-Dimensional Tilings with Congruent Copies of a 3-Point Set. JCDCG 1998: 220-234 - 1997
- [j1]Hikoe Enomoto, Tomoki Nakamigawa, Katsuhiro Ota:
On the Pagenumber of Complete Bipartite Graphs. J. Comb. Theory B 71(1): 111-120 (1997)
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 21:26 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:
