7 citations · 20 across the 4 of their papers we have counts for
4 papers
Facial unique-maximum colorings of plane graphs with restriction on big vertices
Bernard Lidický, Kacy Messerschmidt, Riste Škrekovski
A facial unique-maximum coloring of a plane graph is a proper coloring of the vertices using positive integers such that each face has a unique vertex that receives the maximum col…
A counterexample to a conjecture on facial unique-maximal colorings
Bernard Lidický, Kacy Messerschmidt, Riste Škrekovski
A facial unique-maximum coloring of a plane graph is a proper vertex coloring by natural numbers where on each face the maximal color appears exactly once on the vertices of $α…
Injective choosability of subcubic planar graphs with girth 6
Boris Brimkov, Jennifer Edmond, Robert Lazar +3
An injective coloring of a graph is an assignment of colors to the vertices of so that any two vertices with a common neighbor have distinct colors. A graph is injectiv…
(4,2)-choosability of planar graphs with forbidden structures
Zhanar Berikkyzy, Christopher Cox, Michael Dairyko +8
All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lis…