# Michitaka Furuya

Orcid: 0000-0003-0991-6122
According to our database

Collaborative distances:

^{1}, Michitaka Furuya authored at least 66 papers between 2012 and 2024.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2024

Electron. J. Comb., 2024

2023

Appl. Math. Comput., December, 2023

Graphs Comb., August, 2023

Discret. Appl. Math., July, 2023

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

CoRR, 2023

2022

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

Discuss. Math. Graph Theory, 2022

Discret. Appl. Math., 2022

Discret. Appl. Math., 2022

Electron. J. Comb., 2022

2021

J. Comb. Optim., 2021

Discret. Math., 2021

Discret. Math., 2021

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

Discret. Appl. Math., 2021

2020

J. Graph Theory, 2020

Graphs Comb., 2020

Discret. Math., 2020

2019

Inf. Process. Lett., 2019

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

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

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

Graphs Comb., 2019

Discret. Appl. Math., 2019

Discret. Appl. Math., 2019

Discret. Appl. Math., 2019

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

Electron. J. Comb., 2019

2018

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

J. Graph Theory, 2018

Graphs Comb., 2018

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

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

Discret. Math., 2018

Discret. Optim., 2018

Discret. Appl. Math., 2018

Electron. J. Comb., 2018

2017

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

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

Discret. Math., 2017

Discret. Appl. Math., 2017

Electron. J. Comb., 2017

Electron. J. Comb., 2017

2016

J. Graph Theory, 2016

J. Graph Theory, 2016

Graphs Comb., 2016

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

Ars Comb., 2016

2015

J. Graph Theory, 2015

Graphs Comb., 2015

Graphs Comb., 2015

Graphs Comb., 2015

Discret. Math., 2015

Discret. Math., 2015

Discret. Appl. Math., 2015

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

Discret. Appl. Math., 2015

Electron. J. Comb., 2015

Australas. J Comb., 2015

2014

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

Graphs Comb., 2014

Discuss. Math. Graph Theory, 2014

Discret. Math., 2014

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

Discret. Appl. Math., 2014

Discret. Appl. Math., 2014

Electron. J. Comb., 2014

2013

Graphs Comb., 2013

Graphs Comb., 2013

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

Discret. Math., 2013

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

Discret. Appl. Math., 2013

Discret. Appl. Math., 2013

Comb. Probab. Comput., 2013

Australas. J Comb., 2013

2012

Discret. Appl. Math., 2012

Discret. Appl. Math., 2012

Electron. J. Comb., 2012

Australas. J Comb., 2012