default search action

combined dblp search
author search
venue search
publication search

ask others

Gary Tiner

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

2018
[j4]
- no documents available
  - details & citations
- export record
  dblp key:
  - journals/arscom/GilbertT18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/GilbertT18
Adam Gilbert, Gary Tiner:
On the Erdos-Sos Conjecture for spiders in graphs having no path with 2k+1 vertices. Ars Comb. 139: 297-313 (2018)
2013
[j3]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/dm/EatonT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/EatonT13
Nancy Eaton, Gary Tiner:
On the Erdős-Sós conjecture for graphs having no path with k+4 vertices. Discret. Math. 313(16): 1621-1629 (2013)
2010
[j2]
- no documents available
  - details & citations
- export record
  dblp key:
  - journals/arscom/EatonT10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/EatonT10
Nancy Eaton, Gary Tiner:
On the Erdos-Sos Conjecture and graphs with large minimum degree. Ars Comb. 95 (2010)
[j1]
- no documents available
  - details & citations
- export record
  dblp key:
  - journals/arscom/Tiner10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/Tiner10
Gary Tiner:
On the Erdos-Sos Conjecture for Graphs on n = k+3 Vertices. Ars Comb. 95 (2010)

Coauthor Index

see FAQ

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.