3 citations · 7 across the 10 of their papers we have counts for
12 papers
Ramsey-type results for path covers and path partitions
Shuya Chiba, Michitaka Furuya
A family of subgraphs of is called a {\it path cover} (resp. a {\it path partition}) of if (resp. $\dot\bigcup _{P\in \…
A continuous generalization of domination-like invariants
Michitaka Furuya
In this paper, we define a new domination-like invariant of graphs. Let be the set of non-negative numbers. Let be a number, and let $G…
The uniqueness of covers for widely generalized line graphs
Michitaka Furuya, Sho Kubota, Tetsuji Taniguchi +1
As a natural generalization of line graphs, Hoffman line graphs were defined by Woo and Neumaier. Especially, Hoffman line graphs are closely related to the smallest eigenvalue of…
An algebraic reduction of Hedetniemi's conjecture
Ryoya Fukasaku, Michitaka Furuya, Akihiro Higashitani
For a graph , let denote the chromatic number. In graph theory, the following famous conjecture posed by Hedetniemi has been studied: For two graphs and , $χ(G\tim…
Small domination-type invariants in random graphs
Michitaka Furuya, Tamae Kawasaki
For and a graph , a function is called a -self dominating function of if for every vertex ,…
A Ramsey-type theorem for the matching number regarding connected graphs
Ilkyoo Choi, Michitaka Furuya, Ringi Kim +1
A major line of research is discovering Ramsey-type theorems, which are results of the following form: given a graph parameter , every graph with sufficiently large c…