research
∙
02/05/2022
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
A conflict-free coloring of a graph with respect to open (resp., closed)...
share
research
∙
06/25/2018
Even Longer Cycles in Essentially 4-Connected Planar Graphs
A planar graph is essentially 4-connected if it is 3-connected and every...
research
∙
10/16/2017
