Unique-maximum coloring of plane graphs. | 3 | 0.49 | 2016 |
Prescribed edges and forbidden edges for a cycle in a planar graph | 0 | 0.34 | 2013 |
On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations. | 0 | 0.34 | 2013 |
The potential of greed for independence | 9 | 0.62 | 2012 |
Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian | 4 | 0.55 | 2012 |
The rotational dimension of a graph | 3 | 0.41 | 2011 |
GreedyMAX-type algorithms for the maximum independent set problem | 3 | 0.42 | 2011 |
Random Procedures for Dominating Sets in Graphs. | 1 | 0.40 | 2010 |
On F-independence in graphs. | 9 | 0.74 | 2009 |
Learning of winning strategies for terminal games with linear-size memory | 0 | 0.34 | 2009 |
Embedded in the Shadow of the Separator | 16 | 2.43 | 2008 |
Local Topological Toughness and Local Factors | 0 | 0.34 | 2007 |
On cycles through specified vertices | 2 | 0.42 | 2006 |
On Domination in Graphs. | 3 | 0.50 | 2005 |
A proof of Menger's Theorem by contraction. | 0 | 0.34 | 2002 |
On 2-regular subgraphs in polyhedral graphs | 0 | 0.34 | 2002 |