![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Denis Hanson
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [j20]Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
Time constrained graph searching. Theor. Comput. Sci. 399(3): 158-168 (2008) - 2007
- [c2]Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
Arc Searching Digraphs Without Jumping. COCOA 2007: 354-365 - [c1]Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
Lower Bounds on Edge Searching. ESCAPE 2007: 516-527 - 2004
- [j19]Denis Hanson, John W. Moon:
Weakening arcs in tournaments. J. Graph Theory 45(2): 142-162 (2004) - 2003
- [j18]Ruth Haas, Denis Hanson, Gary MacGillivray:
Bounds For Partial List Colourings. Ars Comb. 67 (2003) - 2002
- [j17]Sheila Ferneyhough, Ruth Haas
, Denis Hanson, Gary MacGillivray:
Star forests, dominating sets and Ramsey-type problems. Discret. Math. 245(1-3): 255-262 (2002)
1990 – 1999
- 1998
- [j16]Suqin Ao, Denis Hanson:
Score Vectors and Tournaments with Cyclic Chromatic Number 1 or 2. Ars Comb. 49 (1998) - [j15]Denis Hanson, C. O. M. Loten, Bjarne Toft:
On interval colourings of bi-regular bipartite graphs. Ars Comb. 50 (1998) - 1996
- [j14]Denis Hanson, Gary MacGillivray, Bjarne Toft:
Choosability of bipartite graphs. Ars Comb. 44 (1996) - 1995
- [j13]Jason Fulman, Denis Hanson, Gary MacGillivray:
Vertex domination-critical graphs. Networks 25(2): 41-43 (1995) - 1994
- [j12]Denis Hanson, Ping Wang, Gary MacGillivray:
A note on minimum graphs with girth pair (4, 2l + 1). J. Graph Theory 18(4): 325-327 (1994) - 1993
- [j11]Denis Hanson, Gary MacGillivray, Dale Youngs:
The size of a minimum five-chromatic K4-free graph. Discret. Math. 122(1-3): 353-355 (1993) - 1992
- [j10]Denis Hanson:
A quick proof that K10 != P + P + P. Discret. Math. 101(1-3): 107-108 (1992) - [j9]Denis Hanson, Ping Wang, Leif K. Jørgensen:
On cages with given degree sets. Discret. Math. 101(1-3): 109-114 (1992)
1980 – 1989
- 1987
- [j8]Denis Hanson, Bjarne Toft:
Edge-colored saturated graphs. J. Graph Theory 11(2): 191-196 (1987) - 1986
- [j7]D. A. Duffus, Denis Hanson:
Minimal k-saturated and color critical graphs of prescribed minimum degree. J. Graph Theory 10(1): 55-67 (1986)
1970 – 1979
- 1977
- [j6]H. L. Abbott, Denis Hanson:
On finite Δ-systems II. Discret. Math. 17(2): 121-126 (1977) - [j5]Denis Hanson, J. Hanson:
Sum-free sets and ramsey numbers II. Discret. Math. 20: 295-296 (1977) - 1976
- [j4]Denis Hanson:
Sum-free sets and Ramsey numbers. Discret. Math. 14(1): 57-61 (1976) - 1975
- [j3]Harvey L. Abbott, Denis Hanson:
On a combinatorial problem in geometry. Discret. Math. 12(4): 389-392 (1975) - 1972
- [j2]H. L. Abbott, Denis Hanson:
Lower Bounds for Certain Types of van der Waerden Numbers. J. Comb. Theory A 12(1): 143-146 (1972) - [j1]H. L. Abbott, Denis Hanson, Norbert Sauer:
Intersection Theorems for Systems of Sets. J. Comb. Theory A 12(3): 381-389 (1972)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-15 00:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint