84 citations · 146 across the 36 of their papers we have counts for
Showing 2013 · cs.DMShow all
2 papers · 2 filters
cs.DM2013
On Maximum Differential Coloring of Planar Graphs
M. Bekos, A. Das, M. Geyer +3
We study the \emph{maximum differential coloring problem}, where the vertices of an -vertex graph must be labeled with distinct numbers ranging from to , so that the mini…
cs.DM2013
Threshold-Coloring and Unit-Cube Contact Representation of Graphs
Md. Jawaherul Alam, Steven Chaplick, Gašper Fijavž +3
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs…