| |
| 2007 | ||
|---|---|---|
| 7 | EE | Ladislav Nebesky: The interval function of a connected graph and road systems. Discrete Mathematics 307(16): 2067-2073 (2007) |
| 2005 | ||
| 6 | EE | Gary Chartrand, Ladislav Nebesky, Ping Zhang: Hamiltonian colorings of graphs. Discrete Applied Mathematics 146(3): 257-272 (2005) |
| 5 | EE | Gary Chartrand, Ladislav Nebesky, Ping Zhang: On hamiltonian colorings of graphs. Discrete Mathematics 290(2/3): 133-143 (2005) |
| 2004 | ||
| 4 | EE | Ladislav Nebesky: Intervals and steps in a connected graph. Discrete Mathematics 286(1-2): 151-156 (2004) |
| 2003 | ||
| 3 | EE | Gary Chartrand, Ladislav Nebesky, Ping Zhang: Greedy F-colorings of graphs. Discrete Mathematics 272(1): 37-46 (2003) |
| 2 | EE | Henry Martyn Mulder, Ladislav Nebesky: Signpost Systems and Their Underlying Graphs. Electronic Notes in Discrete Mathematics 13: 76-80 (2003) |
| 2001 | ||
| 1 | EE | Ladislav Nebesky: The set of geodesics in a graph. Discrete Mathematics 235(1-3): 323-326 (2001) |
| 1 | Gary Chartrand | [3] [5] [6] |
| 2 | Henry Martyn Mulder | [2] |
| 3 | Ping Zhang | [3] [5] [6] |