7 papers · 1 filter
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…