Michitaka Furuya

From MaRDI portal
Person:343720

Available identifiers

zbMath Open furuya.michitakaMaRDI QIDQ343720

List of research outcomes





PublicationDate of PublicationType
Refinements of degree conditions for the existence of a spanning tree without small degree stems2024-12-02Paper
Forbidden subgraphs restricting vertices of degree two in a spanning tree2024-10-07Paper
Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture2024-09-16Paper
Degree factors with red-blue coloring of regular graphs2024-02-19Paper
A necessary and sufficient condition for the existence of a properly coloured $f$-factor in an edge-coloured graph2023-11-15Paper
Ramsey-type results for path covers and path partitions. II: Digraphs2023-09-12Paper
Factors with red-blue coloring of claw-free graphs and cubic graphs2023-08-03Paper
Note on fair game edge-connectivity of graphs2023-04-27Paper
Ramsey-type results for path covers and path partitions2022-11-08Paper
Factors of bi-regular bipartite graphs2022-10-13Paper
Forbidden triples generating a finite set of graphs with minimum degree three2022-08-24Paper
Small domination-type invariants in random graphs2022-08-24Paper
Bounds on the domination number of a digraph and its reverse2022-02-01Paper
Degree sum condition for the existence of spanning \(k\)-trees in star-free graphs2022-01-03Paper
Existence of a spanning tree having small diameter2021-09-06Paper
A continuous generalization of domination-like invariants2021-08-11Paper
A characterization of trees based on edge-deletion and its applications for domination-type invariants2021-05-31Paper
A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs2021-03-25Paper
Large homeomorphically irreducible trees in path‐free graphs2020-05-21Paper
Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers2020-03-03Paper
The uniqueness of covers for widely generalized line graphs2020-02-19Paper
Characterizing the difference between graph classes defined by forbidden pairs including the claw2020-01-21Paper
A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity2020-01-17Paper
https://portal.mardi4nfdi.de/entity/Q52064392019-12-18Paper
A Ramsey-type theorem for the matching number regarding connected graphs2019-12-17Paper
An algebraic reduction of Hedetniemi's conjecture2019-11-21Paper
Path-factors involving paths of order seven and nine2019-07-22Paper
General upper bounds on independent \(k\)-rainbow domination2019-03-22Paper
Upper bounds on the locating chromatic number of trees2019-03-11Paper
The existence of \(f\)-forests and \(f\)-trees in graphs2019-02-08Paper
A new approach towards a conjecture on intersecting three longest paths2019-01-28Paper
A characterization of domination weak bicritical graphs with large diameter2019-01-11Paper
Sufficient conditions for the existence of a path‐factor which are related to odd components2019-01-03Paper
Monochromatic homeomorphically irreducible trees in 2-edge-colored complete graphs2018-12-10Paper
Forbidden subgraphs for \(k\) vertex-disjoint stars2018-12-10Paper
Forbidden subgraphs for constant domination number2018-12-10Paper
A note on domination 3-edge-critical planar graphs2018-12-05Paper
Safe number and integrity of graphs2018-09-06Paper
Upper bound on 3-rainbow domination in graphs with minimum degree 22018-08-20Paper
Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles2018-06-07Paper
The existence of a path-factor without small odd paths2018-05-25Paper
https://portal.mardi4nfdi.de/entity/Q53742472018-04-10Paper
Distance-restricted matching extendability of fullerene graphs2018-03-23Paper
Vertex-addition strategy for domination-like invariants2017-09-08Paper
Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle2017-08-29Paper
Forbidden pairs with a common graph generating almost the same sets2017-05-18Paper
The \(k\)-rainbow reinforcement numbers in graphs2017-03-15Paper
Dominating cycles and forbidden pairs containing \(P_5\)2016-11-29Paper
Upper bound on the diameter of a total domination vertex critical graph.2016-10-26Paper
Partitioning a Graph into Highly Connected Subgraphs2016-08-12Paper
Perfect matchings avoiding several independent edges in a star-free graph2016-06-10Paper
Claw-free and \(N(2,1,0)\)-free graphs are almost net-free2015-12-17Paper
The existence of semi-colorings in a graph2015-09-24Paper
https://portal.mardi4nfdi.de/entity/Q29473922015-09-23Paper
Forbidden triples generating a finite set of 3-connected graphs2015-08-27Paper
Forbidden pairs and the existence of a dominating cycle2015-08-05Paper
A Note on the Domination Number of Triangulations2015-05-22Paper
General bounds on rainbow domination numbers2015-05-22Paper
Difference of forbidden pairs containing a claw2015-05-02Paper
Forbidden quadruplets generating a finite set of 2-connected graphs2015-04-29Paper
A note on total domination and 2-rainbow domination in graphs2015-04-28Paper
The connectivity of domination dot-critical graphs with no critical vertices2014-11-18Paper
Forbidden triples containing a complete graph and a complete bipartite graph of small order2014-09-19Paper
On the ratio of the domination number and the independent domination number in graphs2014-09-12Paper
A note on covering edge colored hypergraphs by monochromatic components2014-09-04Paper
Forbidden subgraphs and the existence of a 2-walk2014-08-21Paper
Upper bounds on the diameter of domination dot-critical graphs with given connectivity2014-04-10Paper
Forbidden Subgraphs Generating Almost the Same Sets2014-02-24Paper
Rainbow domination numbers on graphs with given radius2014-02-18Paper
Forbidden subgraphs and the existence of a spanning tree without small degree stems2014-01-23Paper
Covers in 5-uniform intersecting families with covering number three2014-01-03Paper
Upper bounds on the paired domination subdivision number of a graph2013-07-19Paper
Difference between 2-rainbow domination and roman domination in graphs2013-04-18Paper
Upper bound on the diameter of a domination dot-critical graph2013-02-25Paper
Partition of graphs and hypergraphs into monochromatic connected parts2012-10-24Paper
Construction of (\(\gamma, k\))-critical graphs2012-09-05Paper
Covers in 4-uniform intersecting families with covering number three2012-08-29Paper
\(k\)-rainbow domatic numbers2012-05-30Paper
Constructing connected bicritical graphs with edge-connectivity 22012-05-04Paper
Ramsey-type problems on induced covers and induced partitions toward the Gy\'{a}rf\'{a}s-Sumner conjectureN/APaper
Refinements of degree conditions for the existence of a spanning tree without small degree stemsN/APaper
New strategy on the existence of a spanning tree without small degree stemsN/APaper
New Invariants for Partitioning a Graph into 2-connected SubgraphsN/APaper
Forbidden subgraphs generating a finite set of graphs with minimum degree three and large girthN/APaper

Research outcomes over time

This page was built for person: Michitaka Furuya