Masaki Kashima

collaborators

4 papers

math.CO2025

Odd coloring of $k$ -trees

Masaki Kashima, Kenta Ozeki

An odd coloring of a graph is a proper coloring such that every non-isolated vertex has a color that appears at an odd number of its neighbors. This notion was introduced by Petrše…

math.CO2025

Degree sum conditions and a 2-factor with a bounded number of cycles in claw-free graphs

Masaki Kashima

A claw-free graph is a graph that does not contain $K_{1, 3}$ as an induced subgraph, and a 2-factor is a 2-regular spanning subgraph of a graph. In 1997, Ryjáček introduced the clo…

math.CO2024

Odd 4-coloring of outerplanar graphs

Masaki Kashima, Xuding Zhu

A proper $k$ -coloring of $G$ is called an odd coloring of $G$ if for every vertex $v$ , there is a color that appears at an odd number of neighbors of $v$ . This concept was introduc…

math.CO2024

New Invariants for Partitioning a Graph into 2-connected Subgraphs

Michitaka Furuya, Masaki Kashima, Katsuhiro Ota

A vertex partition in which every part induces a 2-connected subgraph is called a 2-proper partition. This concept was introduced by Ferrara et al. in 2013, and Borozan et al. gave…

Odd coloring of k-trees

Degree sum conditions and a 2-factor with a bounded number of cycles in claw-free graphs

Odd 4-coloring of outerplanar graphs

New Invariants for Partitioning a Graph into 2-connected Subgraphs

Odd coloring of $k$ -trees