16 papers
A Solution to the Kohayakawa-Prömel-Rödl Conjecture
Chuang Zhong, Masaki Kashima, Yaping Mao
The induced Ramsey number is defined as the minimum order of a graph such that any 2-coloring of its edges with red and blue leads to either a red induc…
The rich-neighbor chromatic index is linear in the maximum degree
Masaki Kashima, Mirko Petruševski, Jelena Sedlar +1
An edge of a multigraph is rich with respect to a proper edge-coloring if all the edges adjacent to it receive mutually distinct colors, and a proper edge-coloring is a rich-neighb…
Diagonal Ramsey numbers for wheels
Maoxuan Li, Masaki Kashima, Yaping Mao
The Ramsey number is the smallest integer such that any red-blue coloring of the edges of the complete graph contains either a red copy of or…
List packing of graphs with bounded tree-width
Masaki Kashima, Shun-ichi Maezawa, Xuding Zhu
Assume is a -assignment of a graph . An -packing of is a sequence of -mappings such that each is an -coloring of , and fo…
Induced Ramsey numbers for fans
Chuang Zhong, Masaki Kashima, Yaping Mao +1
The induced Ramsey number is defined as the minimum order of a graph on such that any 2-coloring of its edges with red and blue leads to either a red in…
A Note on Grünbaum's Conjecture about Longest Cycles and Paths
Masaki Kashima, Kenta Ozeki, Leilei Zhang
Let denote the circumference of a graph , i.e., the number of vertices in its longest cycle. For positive integers and with , let be the cla…
Degree-choosability of proper conflict-free list coloring of sparse graphs
Masaki Kashima, Riste Škrekovski, Rongxing Xu
Given a graph and a mapping , an -list assignment of is a function that maps each to a set of at least colors. For an -list…
A note on the number of non-cycle components in a pseudo 2-factor of graphs
Masaki Kashima
A pseudo 2-factor of a graph is a spanning subgraph such that each component is , , or a cycle. This notion was introduced by Bekkai and Kouider in 2009, where they showe…
Remarks on proper conflict-free degree-choosability of graphs with prescribed degeneracy
Masaki Kashima, Riste Škrekovski, Rongxing Xu
A proper coloring of is called a proper conflict-free coloring of if for every non-isolated vertex of , there is a color such that …
Proper conflict-free degree-choosability of outerplanar graphs
Masaki Kashima, Riste Škrekovski, Rongxing Xu
A proper coloring of is called a proper conflict-free coloring of if for every non-isolated vertex of , there is a color such that …
Results on proper conflict-free list coloring of graphs
Masaki Kashima, Riste Škrekovski, Rongxing Xu
Given a graph and a mapping , an -list assignment of is a function that maps each to a set of at least colors. For an -list…
Odd coloring of -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…
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 as an induced subgraph, and a 2-factor is a 2-regular spanning subgraph of a graph. In 1997, Ryjáček introduced the clo…
New type degree conditions for a graph to have a 2-factor
Masaki Kashima
A 2-factor of a graph is a 2-regular spanning subgraph. For a graph and an independent set of , let denote the minimum degree of vertices contained in . We s…
Odd 4-coloring of outerplanar graphs
Masaki Kashima, Xuding Zhu
A proper -coloring of is called an odd coloring of if for every vertex , there is a color that appears at an odd number of neighbors of . This concept was introduc…
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…