Vertex Identification in Grids and Prisms | 0 | 0.34 | 2022 |
Distance Vertex Identification In Graphs | 0 | 0.34 | 2021 |
Uniformly Connected Graphs - A Survey. | 0 | 0.34 | 2020 |
Another view of bipartite Ramsey numbers. | 0 | 0.34 | 2018 |
On the connectedness of 3-line graphs. | 0 | 0.34 | 2018 |
On k-Ramsey Numbers of Unicyclic-Star Graphs. | 0 | 0.34 | 2018 |
Rainbow disconnection in graphs. | 1 | 0.39 | 2018 |
On Eulerian irregularity in graphs. | 0 | 0.34 | 2014 |
On closed modular colorings of trees. | 0 | 0.34 | 2013 |
The Rainbow Connectivities of Small Cubic Graphs. | 2 | 0.45 | 2012 |
Nowhere-zero modular edge-graceful graphs. | 2 | 0.43 | 2012 |
The γ-Spectrum of a Graph. | 0 | 0.34 | 2011 |
On multiset colorings of graphs. | 2 | 0.55 | 2010 |
Rainbow trees in graphs and generalized connectivity | 37 | 3.31 | 2010 |
The Sigma Chromatic Number of a Graph | 2 | 0.78 | 2009 |
The Sigma Chromatic Number of a Graph | 2 | 0.78 | 2009 |
The rainbow connectivity of a graph | 33 | 5.59 | 2009 |
Recognizable colorings of graphs. | 5 | 1.05 | 2008 |
Distance defined by spanning trees in graphs. | 1 | 0.37 | 2007 |
Uniformly cordial graphs | 4 | 0.71 | 2006 |
On γ-labelings of trees. | 1 | 0.43 | 2005 |
On hamiltonian colorings of graphs | 2 | 0.56 | 2005 |
Resolving Edge Colorings In Graphs | 4 | 1.31 | 2005 |
Resolving Acyclic Partitions Of Graphs | 1 | 0.52 | 2004 |
On The Detour Number And Geodetic Number Of A Graph | 3 | 0.82 | 2004 |
Conditional resolvability in graphs: a survey | 21 | 1.95 | 2004 |
Radio k-colorings of paths. | 11 | 1.55 | 2004 |
Detour Domination In Graphs | 0 | 0.34 | 2004 |
Nonplanar Sequences Of Iterated R-Jump Graphs | 0 | 0.34 | 2003 |
Stratification and domination in graphs | 6 | 0.78 | 2003 |
Greedy F-colorings of graphs | 1 | 0.42 | 2003 |
On k-dimensional graphs and their bases. | 23 | 2.28 | 2003 |
Connected Resolving Sets In Graphs | 2 | 0.55 | 2003 |
On the geodetic number of a graph | 40 | 4.46 | 2002 |
Radio Labelings Of Cycles | 16 | 1.35 | 2002 |
The Steiner number of a graph | 14 | 1.55 | 2002 |
Convexity in oriented graphs | 7 | 0.96 | 2002 |
The Upper Forcing Geodetic Number Of A Graph | 4 | 0.62 | 2002 |
Connected partition dimensions of graphs. | 2 | 0.59 | 2002 |
On graphs with a unique minimum hull set. | 2 | 0.44 | 2001 |
On the planarity of iterated jump graphs | 0 | 0.34 | 2001 |
Orientation distance graphs | 1 | 0.63 | 2001 |
Full domination in graphs. | 0 | 0.34 | 2001 |
Geodetic sets in graphs. | 7 | 0.90 | 2000 |
The geodetic number of an oriented graph | 16 | 2.67 | 2000 |
On The Hull Number Of A Graph | 3 | 0.66 | 2000 |
The forcing geodetic number of a graph. | 14 | 2.89 | 1999 |