The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ladislav Nebesky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gary Chartrand, Ladislav Nebesky, Ping Zhang
    Hamiltonian colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:146, n:3, pp:257-272 [Journal]
  2. Gary Chartrand, Ladislav Nebesky, Ping Zhang
    Greedy F-colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:272, n:1, pp:37-46 [Journal]
  3. Gary Chartrand, Ladislav Nebesky, Ping Zhang
    On hamiltonian colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:133-143 [Journal]
  4. Ladislav Nebesky
    The set of geodesics in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:323-326 [Journal]
  5. Ladislav Nebesky
    Intervals and steps in a connected graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:1-2, pp:151-156 [Journal]
  6. Ladislav Nebesky
    The interval function of a connected graph and road systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:2067-2073 [Journal]

  7. Distance-hereditary graphs and signpost systems. [Citation Graph (, )][DBLP]


  8. Axiomatic characterization of the interval function of a graph. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002