Остановите войну!
for scientists:
default search action
Cornelis Hoede
Person information
- affiliation: University of Twente, Enschede, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [j17]Ligong Wang, Cornelis Hoede:
Constructing Fifteen Infinite Classes of Nonregular Bipartite Integral Graphs. Electron. J. Comb. 15(1) (2008) - [j16]Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still:
Some families of integral graphs. Discret. Math. 308(24): 6383-6391 (2008) - 2007
- [j15]Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still:
Integral trees of diameter 6. Discret. Appl. Math. 155(10): 1254-1266 (2007) - 2006
- [c6]Yuanqing Guo, Cornelis Hoede, Gerard J. M. Smit:
A Column Arrangement Algorithm for a Coarse-grained Reconfigurable Architecture. ERSA 2006: 117-122 - [c5]Yuanqing Guo, Cornelis Hoede, Gerard J. M. Smit:
A pattern selection algorithm for multi-pattern scheduling. IPDPS 2006 - 2005
- [j14]Ligong Wang, Xueliang Li, Cornelis Hoede:
Two Classes of Integral Regular Graphs. Ars Comb. 76 (2005) - [c4]Yuanqing Guo, Cornelis Hoede, Gerard J. M. Smit:
A Multi-Pattern Scheduling Algorithm. ERSA 2005: 276- - 2004
- [j13]Ligong Wang, Xueliang Li, Cornelis Hoede:
Integral complete r-partite graphs. Discret. Math. 283(1-3): 231-241 (2004) - 2002
- [j12]Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li:
Degree sums and subpancyclicity in line graphs. Discret. Math. 242(1-3): 255-267 (2002) - 2001
- [j11]Hao Sun, Shenggui Zhang, Xueliang Li, Theo S. H. Driessen, Cornelis Hoede:
A Co-Marginalistic Contribution Value for Set Games. IGTR 3(4): 351-362 (2001) - [c3]Cornelis Hoede, L. Zhang:
Word Graphs: The Third Set. ICCS 2001: 15-28
1990 – 1999
- 1999
- [j10]Hajo Broersma, Cornelis Hoede:
Another equivalent of the graceful tree conjecture. Ars Comb. 51 (1999) - [j9]F. Göbel, Cornelis Hoede:
Magic Labelings of Graphs. Ars Comb. 51 (1999) - [j8]Cornelis Hoede:
A Comparison of Some Conditions for Non-Hamiltonicity of Graphs. Ars Comb. 51 (1999) - 1998
- [c2]Cornelis Hoede, X. Liu:
Word Graphs: The Second Set. ICCS 1998: 375-389 - 1995
- [c1]Cornelis Hoede:
On the Ontology of Knowledge Graphs. ICCS 1995: 308-322 - 1994
- [j7]Cornelis Hoede, Xueliang Li:
Clique polynomials and independent set polynomials of graphs. Discret. Math. 125(1-3): 219-228 (1994) - 1992
- [j6]Cornelis Hoede:
A characterization of consistent marked graphs. J. Graph Theory 16(1): 17-23 (1992)
1980 – 1989
- 1989
- [j5]Haitze J. Broersma, Cornelis Hoede:
Path graphs. J. Graph Theory 13(4): 427-444 (1989) - 1988
- [j4]Cornelis Hoede:
Hard graphs for the maximum clique problem. Discret. Math. 72(1-3): 175-179 (1988) - 1981
- [j3]Cornelis Hoede, Henk Jan Veldman:
Contraction theorems in Hamiltonian graph theory. Discret. Math. 34(1): 61-67 (1981)
1970 – 1979
- 1979
- [j2]F. Göbel, Cornelis Hoede:
On an Optimality Property of Ternary Trees. Inf. Control. 42(1): 10-26 (1979) - 1978
- [j1]Cornelis Hoede, Henk Jan Veldman:
On characterization of Hamiltonian graphs. J. Comb. Theory, Ser. B 25(1): 47-53 (1978)
Coauthor Index
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 2023-09-27 22:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint