Michitaka Furuya

General Bounds on Rainbow Domination Numbers

A k-rainbow dominating function of a graph G is a function f from the vertices V(G) to

Forbidden pairs and the existence of a dominating cycle

{2^{\{1, 2, \dots, k\}}}

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

2{1,2,⋯,k} such that, for all

A characterization of P 5 -free graphs with a homeomorphically irreducible spanning tree

{v \in V(G)}

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

v∈V(G), either