Michitaka Furuya

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 49

Top Topics

Connected Graphs

Bipartite Graph

Top Venues

Discret. Appl. Math.

Electron. J. Comb.

Publications

Michitaka Furuya, Mikio Kano
Degree Factors with Red-Blue Coloring of Regular Graphs. Electron. J. Comb. 31 (1) (2024)
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 (2023)
Michitaka Furuya, Naoki Matsumoto, Yumiko Ohno, Kenta Ozeki
Note on fair game edge-connectivity of graphs. Discret. Appl. Math. 333 (2023)
Michitaka Furuya, Mikio Kano
Factors with Red-Blue Coloring of Claw-Free Graphs and Cubic Graphs. Graphs Comb. 39 (4) (2023)
Shuya Chiba, Michitaka Furuya
Ramsey-type results for path covers and path partitions. II. digraphs. Appl. Math. Comput. 458 (2023)
Yoshimi Egawa, Michitaka Furuya, Mikio Kano
Factors of bi-regular bipartite graphs. Discret. Appl. Math. 322 (2022)
Yoshimi Egawa, Michitaka Furuya
Forbidden triples generating a finite set of graphs with minimum degree three. Discret. Appl. Math. 320 (2022)
Shuya Chiba, Michitaka Furuya
Ramsey-Type Results for Path Covers and Path Partitions. Electron. J. Comb. 29 (4) (2022)
Michitaka Furuya, Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda, Shoichi Tsuchiya, Takamasa Yashima
-trees in star-free graphs. Discuss. Math. Graph Theory 42 (1) (2022)
Shuya Chiba, Michitaka Furuya
A characterization of 2-connected {K1, 3, N3, 1, 1}-free non-Hamiltonian graphs. Discret. Math. 344 (5) (2021)
Michitaka Furuya
A continuous generalization of domination-like invariants. J. Comb. Optim. 41 (4) (2021)
Yoshimi Egawa, Michitaka Furuya, Hajime Matsumura
Existence of a spanning tree having small diameter. Discret. Math. 344 (11) (2021)
Michitaka Furuya
A characterization of trees based on edge-deletion and its applications for domination-type invariants. Discret. Appl. Math. 299 (2021)
Ilkyoo Choi, Michitaka Furuya, Ringi Kim, Boram Park
A Ramsey-type theorem for the matching number regarding connected graphs. Discret. Math. 343 (2) (2020)
Michitaka Furuya, Shoichi Tsuchiya
Large homeomorphically irreducible trees in path-free graphs. J. Graph Theory 93 (3) (2020)
Michitaka Furuya, Shun-ichi Maezawa, Kenta Ozeki
Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers. Graphs Comb. 36 (1) (2020)
Michitaka Furuya, Maho Yokota
Forbidden Subgraphs Generating Almost All Claw-Free Graphs with High Connectivity. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2019)
Michitaka Furuya, Takamasa Yashima
The existence of f-forests and f-trees in graphs. Discret. Appl. Math. 254 (2019)
Michitaka Furuya, Naoki Matsumoto
A note on domination 3-edge-critical planar graphs. Inf. Process. Lett. 142 (2019)
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) (2019)
Michitaka Furuya, Naoki Matsumoto
Upper bounds on the locating chromatic number of trees. Discret. Appl. Math. 257 (2019)
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) (2019)
Shinya Fujita, Michitaka Furuya, Colton Magnant
General upper bounds on independent k-rainbow domination. Discret. Appl. Math. 258 (2019)
Shinya Fujita, Michitaka Furuya
Safe number and integrity of graphs. Discret. Appl. Math. 247 (2018)
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) (2018)
Yoshimi Egawa, Michitaka Furuya
The Existence of a Path-Factor without Small Odd Paths. Electron. J. Comb. 25 (1) (2018)
Michitaka Furuya
Forbidden subgraphs for constant domination number. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Yoshimi Egawa, Michitaka Furuya
Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles. Discret. Math. 341 (8) (2018)
Michitaka Furuya
A Characterization of Domination Weak Bicritical Graphs with Large Diameter. Graphs Comb. 34 (5) (2018)
Michitaka Furuya, Masaki Koyanagi, Maho Yokota
Upper bound on 3-rainbow domination in graphs with minimum degree 2. Discret. Optim. 29 (2018)
Jafar Amjadi, Leila Asgharsharghi, Nasrin Dehgardi, Michitaka Furuya, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
The k-rainbow reinforcement numbers in graphs. Discret. Appl. Math. 217 (2017)
Michitaka Furuya, Naoki Matsumoto
Vertex-Addition Strategy for Domination-Like Invariants. Electron. J. Comb. 24 (3) (2017)
Shuya Chiba, Jun Fujisawa, Michitaka Furuya, Hironobu Ikarashi
Forbidden Pairs with a Common Graph Generating Almost the Same Sets. Electron. J. Comb. 24 (2) (2017)
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) (2017)
Michitaka Furuya, Takamasa Yashima
Neighborhood-union condition for an [a, b]-factor avoiding a specified Hamiltonian cycle. Discret. Math. 340 (6) (2017)
Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya
. Graphs Comb. 32 (5) (2016)
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) (2016)
Michitaka Furuya, Naoya Kato
Upper bound on the diameter of a total domination vertex critical graph. Ars Comb. 128 (2016)
Yoshimi Egawa, Michitaka Furuya
Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph. J. Graph Theory 82 (1) (2016)
Michitaka Furuya
On the diameter of domination bicritical graphs. Australas. J Comb. 62 (2015)
Shinya Fujita, Michitaka Furuya, Colton Magnant
General Bounds on Rainbow Domination Numbers. Graphs Comb. 31 (3) (2015)
Michitaka Furuya
A note on total domination and 2-rainbow domination in graphs. Discret. Appl. Math. 184 (2015)
Michitaka Furuya, Yuki Okubo
Forbidden quadruplets generating a finite set of 2-connected graphs. Discret. Math. 338 (8) (2015)
Michitaka Furuya, Naoki Matsumoto
A Note on the Domination Number of Triangulations. J. Graph Theory 79 (2) (2015)
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) (2015)
Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya
Forbidden pairs and the existence of a dominating cycle. Discret. Math. 338 (12) (2015)
Michitaka Furuya, Masaru Kamada, Kenta Ozeki
The Existence of Semi-colorings in a Graph. Graphs Comb. 31 (5) (2015)
Michitaka Furuya, Shoichi Tsuchiya
Claw-Free and N(2, 1, 0)-Free Graphs are Almost Net-Free. Graphs Comb. 31 (6) (2015)
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 (2015)
Michitaka Furuya
The connectivity of domination dot-critical graphs with no critical vertices. Discuss. Math. Graph Theory 34 (4) (2014)
Shinya Fujita, Michitaka Furuya
Rainbow domination numbers on graphs with given radius. Discret. Appl. Math. 166 (2014)
Michitaka Furuya
Forbidden subgraphs and the existence of a 2-walk. Discret. Math. 333 (2014)
Michitaka Furuya, Kenta Ozeki, Akinari Sasaki
On the ratio of the domination number and the independent domination number in graphs. Discret. Appl. Math. 178 (2014)
Yoshimi Egawa, Michitaka Furuya
Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order. Graphs Comb. 30 (5) (2014)
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) (2014)
Michitaka Furuya, Masanori Takatou
Upper Bound on the Diameter of a Domination Dot-Critical Graph. Graphs Comb. 29 (1) (2013)
Michitaka Furuya, Shoichi Tsuchiya
Forbidden subgraphs and the existence of a spanning tree without small degree stems. Discret. Math. 313 (20) (2013)
Michitaka Furuya, Masanori Takatou
Covers in 5-uniform intersecting families with covering number three. Australas. J Comb. 55 (2013)
Yoshimi Egawa, Michitaka Furuya, Masanori Takatou
Upper Bounds on the Paired Domination Subdivision Number of a Graph. Graphs Comb. 29 (4) (2013)
Shinya Fujita, Michitaka Furuya, Kenta Ozeki
Forbidden Subgraphs Generating Almost the Same Sets. Comb. Probab. Comput. 22 (5) (2013)
Shinya Fujita, Michitaka Furuya
Difference between 2-rainbow domination and Roman domination in graphs. Discret. Appl. Math. 161 (6) (2013)
Michitaka Furuya
Upper bounds on the diameter of domination dot-critical graphs with given connectivity. Discret. Appl. Math. 161 (16-17) (2013)
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) (2012)
Michitaka Furuya
Construction of (γ, k)-critical graphs. Australas. J Comb. 53 (2012)
Shinya Fujita, Michitaka Furuya, Colton Magnant
k-Rainbow domatic numbers. Discret. Appl. Math. 160 (7-8) (2012)
Xue-Gang Chen, Shinya Fujita, Michitaka Furuya, Moo Young Sohn
Constructing connected bicritical graphs with edge-connectivity 2. Discret. Appl. Math. 160 (4-5) (2012)