The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Tankus: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Tankus, Michael Tarsi
    Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:15, pp:1833-1843 [Journal]
  2. David Tankus, Michael Tarsi
    Well-Covered Claw-Free Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:293-302 [Journal]
  3. David Tankus, Michael Tarsi
    The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:69, n:2, pp:230-233 [Journal]

  4. On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6. [Citation Graph (, )][DBLP]


  5. Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7 [Citation Graph (, )][DBLP]


  6. On Relating Edges in Graphs without Cycles of Length 4 [Citation Graph (, )][DBLP]


  7. Greedily constructing maximal partial f-factors. [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