A proper coloring ϕ of G is called a proper conflict-free coloring of G if for every non-isolated vertex v of G , there is a color c such that | ϕ − 1 ( c ) ∩ N G ( v ) | = 1 . As an analogy of degree-choosability of graphs, we introduced the notion of proper conflict-free ( degree + k ) -choosability of graphs. For a non-negative integer k , a graph G is proper conflict-free ( degree + k ) -choosable if for any list assignment L of G with | L ( v ) | ≥ d G ( v ) + k for every vertex v ∈ V ( G ) , G admits a proper conflict-free coloring ϕ such that ϕ ( v ) ∈ L ( v ) for every vertex v ∈ V ( G ) . In this note, we first remark if a graph G is d -degenerate, then G is proper conflict-free ( degree + d + 1 ) -choosable. Furthermore, when d = 1 , we can reduce the number of colors by showing that every tree is proper conflict-free ( degree + 1 ) -choosable. This motivates us to state a question.
Building similarity graph...
Analyzing shared references across papers
Loading...
Masaki Kashima
Riste Škrekovski
Rongxing Xu
Discrete Mathematics
Keio University
Zhejiang Normal University
Higher Education Centre Novo Mesto
Building similarity graph...
Analyzing shared references across papers
Loading...
Kashima et al. (Wed,) studied this question.
www.synapsesocial.com/papers/69a75d1ec6e9836116a269db — DOI: https://doi.org/10.1016/j.disc.2026.115003
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: