Prefer a chat interface with context about you and your work?
On Choosability with Separation of Planar Graphs with Forbidden Cycles
Abstract We study choosability with separation which is a constrained version of list coloring of graphs. A ‐ list assignment L of a graph G is a function that assigns to each vertex v a list of at least k colors and for any adjacent pair , the lists and …