Cornelis Hoede

	2008
21		Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still: Some families of integral graphs. Discrete Mathematics 308(24): 6383-6391 (2008)
20		Ligong Wang, Cornelis Hoede: Constructing Fifteen Infinite Classes of Nonregular Bipartite Integral Graphs. Electr. J. Comb. 15(1): (2008)
	2007
19		Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still: Integral trees of diameter 6. Discrete Applied Mathematics 155(10): 1254-1266 (2007)
	2006
18		Yuanqing Guo, Cornelis Hoede, Gerard J. M. Smit: A Column Arrangement Algorithm for a Coarse-grained Reconfigurable Architecture. ERSA 2006: 117-122
17		Yuanqing Guo, Cornelis Hoede, Gerard J. M. Smit: A pattern selection algorithm for multi-pattern scheduling. IPDPS 2006
	2005
16		Yuanqing Guo, Cornelis Hoede, Gerard J. M. Smit: A Multi-Pattern Scheduling Algorithm. ERSA 2005: 276-
15		Ligong Wang, Xueliang Li, Cornelis Hoede: Two Classes of Integral Regular Graphs. Ars Comb. 76: (2005)
	2004
14		Ligong Wang, Xueliang Li, Cornelis Hoede: Integral complete r-partite graphs. Discrete Mathematics 283(1-3): 231-241 (2004)
	2002
13		Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li: Degree sums and subpancyclicity in line graphs. Discrete Mathematics 242(1-3): 255-267 (2002)
	2001
12		Cornelis Hoede, L. Zhang: Word Graphs: The Third Set. ICCS 2001: 15-28
11		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)
	1999
10		Cornelis Hoede: A Comparison of Some Conditions for Non-Hamiltonicity of Graphs. Ars Comb. 51: (1999)
9		Hajo Broersma, Cornelis Hoede: Another equivalent of the graceful tree conjecture. Ars Comb. 51: (1999)
8		F. Göbel, Cornelis Hoede: Magic Labelings of Graphs. Ars Comb. 51: (1999)
	1998
7		Cornelis Hoede, X. Liu: Word Graphs: The Second Set. ICCS 1998: 375-389
	1995
6		Cornelis Hoede: On the Ontology of Knowledge Graphs. ICCS 1995: 308-322
	1994
5		Cornelis Hoede, Xueliang Li: Clique polynomials and independent set polynomials of graphs. Discrete Mathematics 125(1-3): 219-228 (1994)
	1988
4		Cornelis Hoede: Hard graphs for the maximum clique problem. Discrete Mathematics 72(1-3): 175-179 (1988)
	1981
3		Cornelis Hoede, Henk Jan Veldman: Contraction theorems in Hamiltonian graph theory. Discrete Mathematics 34(1): 61-67 (1981)
	1979
2		F. Göbel, Cornelis Hoede: On an Optimality Property of Ternary Trees Information and Control 42(1): 10-26 (1979)
	1978
1		Cornelis Hoede, Henk Jan Veldman: On characterization of Hamiltonian graphs. J. Comb. Theory, Ser. B 25(1): 47-53 (1978)

Coauthor Index

1	Hajo Broersma (H. J. Broersma)	[9] [13] [19] [21]
2	Theo S. H. Driessen	[11]
3	F. Göbel	[2] [8]
4	Yuanqing Guo	[16] [17] [18]
5	Xueliang Li	[5] [11] [13] [14] [15] [19] [21]
6	X. Liu	[7]
7	Gerard J. M. Smit	[16] [17] [18]
8	Georg Still (Georg J. Still)	[19] [21]
9	Hao Sun	[11]
10	Henk Jan Veldman	[1] [3]
11	Ligong Wang	[14] [15] [19] [20] [21]
12	Liming Xiong	[13]
13	L. Zhang	[12]
14	Shenggui Zhang	[11]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page