default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichitaka Furuya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j66]Michitaka Furuya, Mikio Kano:
Degree Factors with Red-Blue Coloring of Regular Graphs. Electron. J. Comb. 31(1) (2024)- [j65]Michitaka Furuya, Shoichi Tsuchiya:
Forbidden Subgraphs Restricting Vertices of Degree Two in a Spanning Tree. Electron. J. Comb. 31(3) (2024) - 2023
- [j64]Shuya Chiba, Michitaka Furuya:
Ramsey-type results for path covers and path partitions. II. digraphs. Appl. Math. Comput. 458: 128205 (2023) - [j63]Michitaka Furuya, Naoki Matsumoto
, Yumiko Ohno, Kenta Ozeki:
Note on fair game edge-connectivity of graphs. Discret. Appl. Math. 333: 132-135 (2023) - [j62]Michitaka Furuya, Mikio Kano:
Factors with Red-Blue Coloring of Claw-Free Graphs and Cubic Graphs. Graphs Comb. 39(4): 85 (2023) - [i1]Roman Cada, Michitaka Furuya, Kenji Kimura, Kenta Ozeki, Christopher Purcell, Takamasa Yashima:
A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph. CoRR abs/2311.09042 (2023) - 2022
- [j61]Shuya Chiba, Michitaka Furuya:
Ramsey-Type Results for Path Covers and Path Partitions. Electron. J. Comb. 29(4) (2022) - [j60]Yoshimi Egawa, Michitaka Furuya:
Forbidden triples generating a finite set of graphs with minimum degree three. Discret. Appl. Math. 320: 282-295 (2022) - [j59]Yoshimi Egawa, Michitaka Furuya, Mikio Kano:
Factors of bi-regular bipartite graphs. Discret. Appl. Math. 322: 268-272 (2022) - [j58]Michitaka Furuya, Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda, Shoichi Tsuchiya, Takamasa Yashima:
Degree sum condition for the existence of spanning k-trees in star-free graphs. Discuss. Math. Graph Theory 42(1): 5-13 (2022) - 2021
- [j57]Michitaka Furuya:
A characterization of trees based on edge-deletion and its applications for domination-type invariants. Discret. Appl. Math. 299: 50-61 (2021) - [j56]Shuya Chiba, Michitaka Furuya:
A characterization of 2-connected {K1, 3, N3, 1, 1}-free non-Hamiltonian graphs. Discret. Math. 344(5): 112321 (2021) - [j55]Yoshimi Egawa, Michitaka Furuya, Hajime Matsumura:
Existence of a spanning tree having small diameter. Discret. Math. 344(11): 112548 (2021) - [j54]Michitaka Furuya:
A continuous generalization of domination-like invariants. J. Comb. Optim. 41(4): 905-922 (2021) - 2020
- [j53]Ilkyoo Choi, Michitaka Furuya, Ringi Kim, Boram Park:
A Ramsey-type theorem for the matching number regarding connected graphs. Discret. Math. 343(2): 111648 (2020) - [j52]Michitaka Furuya, Shun-ichi Maezawa, Kenta Ozeki:
Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers. Graphs Comb. 36(1): 167-176 (2020) - [j51]Michitaka Furuya, Shoichi Tsuchiya:
Large homeomorphically irreducible trees in path-free graphs. J. Graph Theory 93(3): 372-394 (2020)
2010 – 2019
- 2019
- [j50]Shuya Chiba, Michitaka Furuya, Kenta Ozeki, Masao Tsugaki, Tomoki Yamashita:
A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity. Electron. J. Comb. 26(4): 4 (2019) - [j49]Michitaka Furuya, Takamasa Yashima:
The existence of f-forests and f-trees in graphs. Discret. Appl. Math. 254: 113-123 (2019) - [j48]Michitaka Furuya, Naoki Matsumoto:
Upper bounds on the locating chromatic number of trees. Discret. Appl. Math. 257: 338-341 (2019) - [j47]Shinya Fujita, Michitaka Furuya, Colton Magnant:
General upper bounds on independent k-rainbow domination. Discret. Appl. Math. 258: 105-113 (2019) - [j46]Guantao Chen, Michitaka Furuya, Songling Shan, Shoichi Tsuchiya, Ping Yang:
Characterizing the Difference Between Graph Classes Defined by Forbidden Pairs Including the Claw. Graphs Comb. 35(6): 1459-1474 (2019) - [j45]Michitaka Furuya, Maho Yokota:
Forbidden Subgraphs Generating Almost All Claw-Free Graphs with High Connectivity. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 987-993 (2019) - [j44]Michitaka Furuya, Naoki Matsumoto:
A note on domination 3-edge-critical planar graphs. Inf. Process. Lett. 142: 64-67 (2019) - 2018
- [j43]Yoshimi Egawa, Michitaka Furuya:
The Existence of a Path-Factor without Small Odd Paths. Electron. J. Comb. 25(1): 1 (2018) - [j42]Shinya Fujita, Michitaka Furuya:
Safe number and integrity of graphs. Discret. Appl. Math. 247: 398-406 (2018) - [j41]Michitaka Furuya, Masaki Koyanagi, Maho Yokota:
Upper bound on 3-rainbow domination in graphs with minimum degree 2. Discret. Optim. 29: 45-76 (2018) - [j40]Yoshimi Egawa, Michitaka Furuya:
Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles. Discret. Math. 341(8): 2276-2284 (2018) - [j39]Michitaka Furuya:
Forbidden subgraphs for constant domination number. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j38]Michitaka Furuya:
A Characterization of Domination Weak Bicritical Graphs with Large Diameter. Graphs Comb. 34(5): 1077-1088 (2018) - [j37]Yoshimi Egawa, Michitaka Furuya, Kenta Ozeki:
Sufficient conditions for the existence of a path-factor which are related to odd components. J. Graph Theory 89(3): 327-340 (2018) - 2017
- [j36]Shuya Chiba, Jun Fujisawa, Michitaka Furuya, Hironobu Ikarashi:
Forbidden Pairs with a Common Graph Generating Almost the Same Sets. Electron. J. Comb. 24(2): 2 (2017) - [j35]Michitaka Furuya, Naoki Matsumoto:
Vertex-Addition Strategy for Domination-Like Invariants. Electron. J. Comb. 24(3): 3 (2017) - [j34]Jafar Amjadi, Leila Asgharsharghi, Nasrin Dehgardi, Michitaka Furuya, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The k-rainbow reinforcement numbers in graphs. Discret. Appl. Math. 217: 394-404 (2017) - [j33]Michitaka Furuya, Takamasa Yashima:
Neighborhood-union condition for an [a, b]-factor avoiding a specified Hamiltonian cycle. Discret. Math. 340(6): 1419-1425 (2017) - [j32]Jafar Amjadi, Nasrin Dehgardi, Michitaka Furuya, Seyed Mahmoud Sheikholeslami:
A sufficient condition for large rainbow domination number. Int. J. Comput. Math. Comput. Syst. Theory 2(2): 53-65 (2017) - 2016
- [j31]Michitaka Furuya, Naoya Kato:
Upper bound on the diameter of a total domination vertex critical graph. Ars Comb. 128: 349-371 (2016) - [j30]Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya:
Dominating Cycles and Forbidden Pairs Containing P5. Graphs Comb. 32(5): 1773-1788 (2016) - [j29]Yoshimi Egawa, Michitaka Furuya:
Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph. J. Graph Theory 82(1): 33-44 (2016) - [j28]Valentin Borozan, Michael Ferrara, Shinya Fujita, Michitaka Furuya, Yannis Manoussakis, Narayanan Narayanan, Derrick Stolee:
Partitioning a Graph into Highly Connected Subgraphs. J. Graph Theory 82(3): 322-333 (2016) - 2015
- [j27]Michitaka Furuya:
On the diameter of domination bicritical graphs. Australas. J Comb. 62: 184-196 (2015) - [j26]Yoshimi Egawa, Jun Fujisawa, Michitaka Furuya, Michael D. Plummer, Akira Saito:
Forbidden Triples Generating a Finite set of 3-Connected Graphs. Electron. J. Comb. 22(3): 3 (2015) - [j25]Michitaka Furuya:
A note on total domination and 2-rainbow domination in graphs. Discret. Appl. Math. 184: 229-230 (2015) - [j24]Jennifer Diemunsch, Michitaka Furuya, Maryam Sharifzadeh, Shoichi Tsuchiya, David Wang, Jennifer Wise, Elyse Yeager:
A characterization of P5-free graphs with a homeomorphically irreducible spanning tree. Discret. Appl. Math. 185: 71-78 (2015) - [j23]Michitaka Furuya, Yuki Okubo:
Forbidden quadruplets generating a finite set of 2-connected graphs. Discret. Math. 338(8): 1277-1283 (2015) - [j22]Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya:
Forbidden pairs and the existence of a dominating cycle. Discret. Math. 338(12): 2442-2452 (2015) - [j21]Shinya Fujita, Michitaka Furuya, Colton Magnant:
General Bounds on Rainbow Domination Numbers. Graphs Comb. 31(3): 601-613 (2015) - [j20]Michitaka Furuya, Masaru Kamada, Kenta Ozeki:
The Existence of Semi-colorings in a Graph. Graphs Comb. 31(5): 1397-1401 (2015) - [j19]Michitaka Furuya, Shoichi Tsuchiya:
Claw-Free and N(2, 1, 0)-Free Graphs are Almost Net-Free. Graphs Comb. 31(6): 2201-2205 (2015) - [j18]Michitaka Furuya, Naoki Matsumoto:
A Note on the Domination Number of Triangulations. J. Graph Theory 79(2): 83-85 (2015) - 2014
- [j17]Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth:
A Note on Covering Edge Colored Hypergraphs by Monochromatic Components. Electron. J. Comb. 21(2): 2 (2014) - [j16]Shinya Fujita, Michitaka Furuya:
Rainbow domination numbers on graphs with given radius. Discret. Appl. Math. 166: 115-122 (2014) - [j15]Michitaka Furuya, Kenta Ozeki, Akinari Sasaki:
On the ratio of the domination number and the independent domination number in graphs. Discret. Appl. Math. 178: 157-159 (2014) - [j14]Michitaka Furuya:
Forbidden subgraphs and the existence of a 2-walk. Discret. Math. 333: 56-61 (2014) - [j13]Michitaka Furuya:
The connectivity of domination dot-critical graphs with no critical vertices. Discuss. Math. Graph Theory 34(4): 683-690 (2014) - [j12]Yoshimi Egawa, Michitaka Furuya:
Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order. Graphs Comb. 30(5): 1149-1162 (2014) - 2013
- [j11]Michitaka Furuya, Masanori Takatou:
Covers in 5-uniform intersecting families with covering number three. Australas. J Comb. 55: 249-262 (2013) - [j10]Shinya Fujita, Michitaka Furuya, Kenta Ozeki:
Forbidden Subgraphs Generating Almost the Same Sets. Comb. Probab. Comput. 22(5): 733-748 (2013) - [j9]Shinya Fujita, Michitaka Furuya:
Difference between 2-rainbow domination and Roman domination in graphs. Discret. Appl. Math. 161(6): 806-812 (2013) - [j8]Michitaka Furuya:
Upper bounds on the diameter of domination dot-critical graphs with given connectivity. Discret. Appl. Math. 161(16-17): 2420-2426 (2013) - [j7]Michitaka Furuya, Shoichi Tsuchiya:
Forbidden subgraphs and the existence of a spanning tree without small degree stems. Discret. Math. 313(20): 2206-2212 (2013) - [j6]Michitaka Furuya, Masanori Takatou:
Upper Bound on the Diameter of a Domination Dot-Critical Graph. Graphs Comb. 29(1): 79-85 (2013) - [j5]Yoshimi Egawa, Michitaka Furuya, Masanori Takatou:
Upper Bounds on the Paired Domination Subdivision Number of a Graph. Graphs Comb. 29(4): 843-856 (2013) - 2012
- [j4]Michitaka Furuya:
Construction of (γ, k)-critical graphs. Australas. J Comb. 53: 53-66 (2012) - [j3]Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth:
Partition of Graphs and Hypergraphs into Monochromatic Connected Parts. Electron. J. Comb. 19(3): 27 (2012) - [j2]Xue-Gang Chen, Shinya Fujita, Michitaka Furuya, Moo Young Sohn:
Constructing connected bicritical graphs with edge-connectivity 2. Discret. Appl. Math. 160(4-5): 488-493 (2012) - [j1]Shinya Fujita, Michitaka Furuya, Colton Magnant:
k-Rainbow domatic numbers. Discret. Appl. Math. 160(7-8): 1104-1113 (2012)
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-10-07 01:29 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:
