2 citations · 4 across the 10 of their papers we have counts for
Showing 2016 · cs.DMShow all
2 papers · 2 filters
cs.DM2016
Improper Twin Edge Coloring of Graphs
Paniz Abedin, Saieed Akbari, Marc Demange +1
Let be a graph whose each component has order at least 3. Let for some integer be an improper edge coloring of (where adjacent…
cs.DM2016
Complexity of choosability with a small palette of colors
Marc Demange, Dominique de Werra
A graph is -choosable if, for any choice of lists of colors for each vertex, there is a list coloring, which is a coloring where each vertex receives a color from its…