10 citations · 16 across the 5 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.CO2024
The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs
James Anderson, Herman Chau, Eun-Kyung Cho +6
We introduce a new tool useful for greedy coloring, which we call the forb-flex method, and apply it to odd coloring and proper conflict-free coloring of planar graphs. The odd chr…
math.CO2024
Strong odd coloring of sparse graphs
Hyemin Kwon, Boram Park
An odd coloring of a graph is a proper coloring of such that for every non-isolated vertex , there is a color appearing an odd number of times in . Odd coloring…