Michitaka Furuya

According to our database1, Michitaka Furuya authored at least 53 papers between 2012 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Large homeomorphically irreducible trees in path-free graphs.
J. Graph Theory, 2020

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

A Ramsey-type theorem for the matching number regarding connected graphs.
Discret. Math., 2020

A note on domination 3-edge-critical planar graphs.
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

The existence of f-forests and f-trees in graphs.
Discret. Appl. Math., 2019

Upper bounds on the locating chromatic number of trees.
Discret. Appl. Math., 2019

General upper bounds on independent k-rainbow domination.
Discret. Appl. Math., 2019

A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity.
Electron. J. Comb., 2019

Sufficient conditions for the existence of a path-factor which are related to odd components.
J. Graph Theory, 2018

A Characterization of Domination Weak Bicritical Graphs with Large Diameter.
Graphs Comb., 2018

Forbidden subgraphs for constant domination number.
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

Upper bound on 3-rainbow domination in graphs with minimum degree 2.
Discret. Optim., 2018

Safe number and integrity of graphs.
Discret. Appl. Math., 2018

The Existence of a Path-Factor without Small Odd Paths.
Electron. J. Comb., 2018

A sufficient condition for large rainbow domination number.
Int. J. Comput. Math. Comput. Syst. Theory, 2017

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

The k-rainbow reinforcement numbers in graphs.
Discret. Appl. Math., 2017

Vertex-Addition Strategy for Domination-Like Invariants.
Electron. J. Comb., 2017

Forbidden Pairs with a Common Graph Generating Almost the Same Sets.
Electron. J. Comb., 2017

Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph.
J. Graph Theory, 2016

Partitioning a Graph into Highly Connected Subgraphs.
J. Graph Theory, 2016

Dominating Cycles and Forbidden Pairs Containing P<sub>5</sub>.
Graphs Comb., 2016

Upper bound on the diameter of a total domination vertex critical graph.
Ars Comb., 2016

A Note on the Domination Number of Triangulations.
J. Graph Theory, 2015

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

The Existence of Semi-colorings in a Graph.
Graphs Comb., 2015

General Bounds on Rainbow Domination Numbers.
Graphs Comb., 2015

Forbidden quadruplets generating a finite set of 2-connected graphs.
Discret. Math., 2015

Forbidden pairs and the existence of a dominating cycle.
Discret. Math., 2015

A note on total domination and 2-rainbow domination in graphs.
Discret. Appl. Math., 2015

A characterization of P5-free graphs with a homeomorphically irreducible spanning tree.
Discret. Appl. Math., 2015

Forbidden Triples Generating a Finite set of 3-Connected Graphs.
Electron. J. Comb., 2015

On the diameter of domination bicritical graphs.
Australas. J Comb., 2015

Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order.
Graphs Comb., 2014

The connectivity of domination dot-critical graphs with no critical vertices.
Discuss. Math. Graph Theory, 2014

Forbidden subgraphs and the existence of a 2-walk.
Discret. Math., 2014

On the ratio of the domination number and the independent domination number in graphs.
Discret. Appl. Math., 2014

Rainbow domination numbers on graphs with given radius.
Discret. Appl. Math., 2014

A Note on Covering Edge Colored Hypergraphs by Monochromatic Components.
Electron. J. Comb., 2014

Upper Bound on the Diameter of a Domination Dot-Critical Graph.
Graphs Comb., 2013

Upper Bounds on the Paired Domination Subdivision Number of a Graph.
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

Difference between 2-rainbow domination and Roman domination in graphs.
Discret. Appl. Math., 2013

Forbidden Subgraphs Generating Almost the Same Sets.
Comb. Probab. Comput., 2013

Covers in 5-uniform intersecting families with covering number three.
Australas. J Comb., 2013

k-Rainbow domatic numbers.
Discret. Appl. Math., 2012

Constructing connected bicritical graphs with edge-connectivity 2.
Discret. Appl. Math., 2012

Partition of Graphs and Hypergraphs into Monochromatic Connected Parts.
Electron. J. Comb., 2012

Construction of (γ, k)-critical graphs.
Australas. J Comb., 2012