Michitaka Furuya

According to our database, Michitaka Furuya authored at least 68 papers between 2012 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

Refinements of degree conditions for the existence of a spanning tree without small degree stems.

Michitaka Furuya, Akira Saito, Shoichi Tsuchiya

Discret. Math., 2025

2024

Forbidden Subgraphs Restricting Vertices of Degree Two in a Spanning Tree.

Michitaka Furuya, Shoichi Tsuchiya

Electron. J. Comb., 2024

Degree Factors with Red-Blue Coloring of Regular Graphs.

Michitaka Furuya, Mikio Kano

Electron. J. Comb., 2024

2023

Ramsey-type results for path covers and path partitions. II. digraphs.

Shuya Chiba, Michitaka Furuya

Appl. Math. Comput., December, 2023

Factors with Red-Blue Coloring of Claw-Free Graphs and Cubic Graphs.

Michitaka Furuya, Mikio Kano

Graphs Comb., August, 2023

Note on fair game edge-connectivity of graphs.

Michitaka Furuya, Naoki Matsumoto, Yumiko Ohno, Kenta Ozeki

Discret. Appl. Math., July, 2023

A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph.

Roman Cada, Michitaka Furuya, Kenji Kimura, Kenta Ozeki, Christopher Purcell, Takamasa Yashima

CoRR, 2023

2022

Degree sum condition for the existence of spanning <i>k</i>-trees in star-free graphs.

Michitaka Furuya, Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda, Shoichi Tsuchiya, Takamasa Yashima

Discuss. Math. Graph Theory, 2022

Factors of bi-regular bipartite graphs.

Yoshimi Egawa, Michitaka Furuya, Mikio Kano

Discret. Appl. Math., 2022

Forbidden triples generating a finite set of graphs with minimum degree three.

Yoshimi Egawa, Michitaka Furuya

Discret. Appl. Math., 2022

Ramsey-Type Results for Path Covers and Path Partitions.

Shuya Chiba, Michitaka Furuya

Electron. J. Comb., 2022

2021

A continuous generalization of domination-like invariants.

Michitaka Furuya

J. Comb. Optim., 2021

Existence of a spanning tree having small diameter.

Yoshimi Egawa, Michitaka Furuya, Hajime Matsumura

Discret. Math., 2021

A characterization of 2-connected {K1, 3, N3, 1, 1}-free non-Hamiltonian graphs.

Shuya Chiba, Michitaka Furuya

Discret. Math., 2021

A characterization of trees based on edge-deletion and its applications for domination-type invariants.

Michitaka Furuya

Discret. Appl. Math., 2021

2020

Large homeomorphically irreducible trees in path-free graphs.

Michitaka Furuya, Shoichi Tsuchiya

J. Graph Theory, 2020

Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers.

Michitaka Furuya, Shun-ichi Maezawa, Kenta Ozeki

Graphs Comb., 2020

A Ramsey-type theorem for the matching number regarding connected graphs.

Ilkyoo Choi, Michitaka Furuya, Ringi Kim, Boram Park

Discret. Math., 2020

2019

A note on domination 3-edge-critical planar graphs.

Michitaka Furuya, Naoki Matsumoto

Inf. Process. Lett., 2019

Forbidden Subgraphs Generating Almost All Claw-Free Graphs with High Connectivity.

Michitaka Furuya, Maho Yokota

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Characterizing the Difference Between Graph Classes Defined by Forbidden Pairs Including the Claw.

Guantao Chen, Michitaka Furuya, Songling Shan, Shoichi Tsuchiya, Ping Yang

Graphs Comb., 2019

The existence of f-forests and f-trees in graphs.

Michitaka Furuya, Takamasa Yashima

Discret. Appl. Math., 2019

Upper bounds on the locating chromatic number of trees.

Michitaka Furuya, Naoki Matsumoto

Discret. Appl. Math., 2019

General upper bounds on independent k-rainbow domination.

Shinya Fujita, Michitaka Furuya, Colton Magnant

Discret. Appl. Math., 2019

A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity.

Shuya Chiba, Michitaka Furuya, Kenta Ozeki, Masao Tsugaki, Tomoki Yamashita

Electron. J. Comb., 2019

2018

Sufficient conditions for the existence of a path-factor which are related to odd components.

Yoshimi Egawa, Michitaka Furuya, Kenta Ozeki

J. Graph Theory, 2018

A Characterization of Domination Weak Bicritical Graphs with Large Diameter.

Michitaka Furuya

Graphs Comb., 2018

Forbidden subgraphs for constant domination number.

Michitaka Furuya

Discret. Math. Theor. Comput. Sci., 2018

Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles.

Yoshimi Egawa, Michitaka Furuya

Discret. Math., 2018

Upper bound on 3-rainbow domination in graphs with minimum degree 2.

Michitaka Furuya, Masaki Koyanagi, Maho Yokota

Discret. Optim., 2018

Safe number and integrity of graphs.

Shinya Fujita, Michitaka Furuya

Discret. Appl. Math., 2018

The Existence of a Path-Factor without Small Odd Paths.

Yoshimi Egawa, Michitaka Furuya

Electron. J. Comb., 2018

2017

A sufficient condition for large rainbow domination number.

Jafar Amjadi, Nasrin Dehgardi, Michitaka Furuya, Seyed Mahmoud Sheikholeslami

Int. J. Comput. Math. Comput. Syst. Theory, 2017

Neighborhood-union condition for an [a, b]-factor avoiding a specified Hamiltonian cycle.

Michitaka Furuya, Takamasa Yashima

Discret. Math., 2017

The k-rainbow reinforcement numbers in graphs.

Jafar Amjadi, Leila Asgharsharghi, Nasrin Dehgardi, Michitaka Furuya, Seyed Mahmoud Sheikholeslami, Lutz Volkmann

Discret. Appl. Math., 2017

Vertex-Addition Strategy for Domination-Like Invariants.

Michitaka Furuya, Naoki Matsumoto

Electron. J. Comb., 2017

Forbidden Pairs with a Common Graph Generating Almost the Same Sets.

Shuya Chiba, Jun Fujisawa, Michitaka Furuya, Hironobu Ikarashi

Electron. J. Comb., 2017

2016

Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph.

Yoshimi Egawa, Michitaka Furuya

J. Graph Theory, 2016

Partitioning a Graph into Highly Connected Subgraphs.

Valentin Borozan, Michael Ferrara, Shinya Fujita, Michitaka Furuya, Yannis Manoussakis, Narayanan Narayanan, Derrick Stolee

J. Graph Theory, 2016

Dominating Cycles and Forbidden Pairs Containing P₅.

Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya

Graphs Comb., 2016

Upper bound on the diameter of a total domination vertex critical graph.

Michitaka Furuya, Naoya Kato

Ars Comb., 2016

2015

A Note on the Domination Number of Triangulations.

Michitaka Furuya, Naoki Matsumoto

J. Graph Theory, 2015

Claw-Free and N(2, 1, 0)-Free Graphs are Almost Net-Free.

Michitaka Furuya, Shoichi Tsuchiya

Graphs Comb., 2015

The Existence of Semi-colorings in a Graph.

Michitaka Furuya, Masaru Kamada, Kenta Ozeki

Graphs Comb., 2015

General Bounds on Rainbow Domination Numbers.

Shinya Fujita, Michitaka Furuya, Colton Magnant

Graphs Comb., 2015

Forbidden quadruplets generating a finite set of 2-connected graphs.

Michitaka Furuya, Yuki Okubo

Discret. Math., 2015

Forbidden pairs and the existence of a dominating cycle.

Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya

Discret. Math., 2015

A note on total domination and 2-rainbow domination in graphs.

Michitaka Furuya

Discret. Appl. Math., 2015

A characterization of P5-free graphs with a homeomorphically irreducible spanning tree.

Jennifer Diemunsch, Michitaka Furuya, Maryam Sharifzadeh, Shoichi Tsuchiya, David Wang, Jennifer Wise, Elyse Yeager

Discret. Appl. Math., 2015

Forbidden Triples Generating a Finite set of 3-Connected Graphs.

Yoshimi Egawa, Jun Fujisawa, Michitaka Furuya, Michael D. Plummer, Akira Saito

Electron. J. Comb., 2015

On the diameter of domination bicritical graphs.

Michitaka Furuya

Australas. J Comb., 2015

2014

Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order.

Yoshimi Egawa, Michitaka Furuya

Graphs Comb., 2014

The connectivity of domination dot-critical graphs with no critical vertices.

Michitaka Furuya

Discuss. Math. Graph Theory, 2014

Forbidden subgraphs and the existence of a 2-walk.

Michitaka Furuya

Discret. Math., 2014

On the ratio of the domination number and the independent domination number in graphs.

Michitaka Furuya, Kenta Ozeki, Akinari Sasaki

Discret. Appl. Math., 2014

Rainbow domination numbers on graphs with given radius.

Shinya Fujita, Michitaka Furuya

Discret. Appl. Math., 2014

A Note on Covering Edge Colored Hypergraphs by Monochromatic Components.

Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth

Electron. J. Comb., 2014

2013

Upper Bound on the Diameter of a Domination Dot-Critical Graph.

Michitaka Furuya, Masanori Takatou

Graphs Comb., 2013

Upper Bounds on the Paired Domination Subdivision Number of a Graph.

Yoshimi Egawa, Michitaka Furuya, Masanori Takatou

Graphs Comb., 2013

Forbidden subgraphs and the existence of a spanning tree without small degree stems.

Michitaka Furuya, Shoichi Tsuchiya

Discret. Math., 2013

Upper bounds on the diameter of domination dot-critical graphs with given connectivity.

Michitaka Furuya

Discret. Appl. Math., 2013

Difference between 2-rainbow domination and Roman domination in graphs.

Shinya Fujita, Michitaka Furuya

Discret. Appl. Math., 2013

Forbidden Subgraphs Generating Almost the Same Sets.

Shinya Fujita, Michitaka Furuya, Kenta Ozeki

Comb. Probab. Comput., 2013

Covers in 5-uniform intersecting families with covering number three.

Michitaka Furuya, Masanori Takatou

Australas. J Comb., 2013

2012

k-Rainbow domatic numbers.

Shinya Fujita, Michitaka Furuya, Colton Magnant

Discret. Appl. Math., 2012

Constructing connected bicritical graphs with edge-connectivity 2.

Xue-Gang Chen, Shinya Fujita, Michitaka Furuya, Moo Young Sohn

Discret. Appl. Math., 2012

Partition of Graphs and Hypergraphs into Monochromatic Connected Parts.

Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth

Electron. J. Comb., 2012

Construction of (γ, k)-critical graphs.

Michitaka Furuya

Australas. J Comb., 2012