V. Faber

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

2009

5 V. Faber, J. Liesen, P. Tichý: On orthogonal reduction to Hessenberg form with small bandwidth. Numerical Algorithms 51(2): 133-142 (2009)

1995

4 Richard N. Draper, V. Faber: The Diameter and Average Distance of Supertoroidal Networks. J. Parallel Distrib. Comput. 31(1): 1-13 (1995)

1994

3 Fan R. K. Chung, V. Faber, Thomas A. Manteuffel: An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian. SIAM J. Discrete Math. 7(3): 443-457 (1994)

1984

2 Andrzej Ehrenfeucht, V. Faber, Hal A. Kierstead: A new method of proving theorems on chromatic index. Discrete Mathematics 52(2-3): 159-164 (1984)

1976

1 Jean-Claude Bermond, V. Faber: Decomposition of the complete directed graph into k-circuits. J. Comb. Theory, Ser. B 21(2): 146-155 (1976)

	2009
5		V. Faber, J. Liesen, P. Tichý: On orthogonal reduction to Hessenberg form with small bandwidth. Numerical Algorithms 51(2): 133-142 (2009)
	1995
4		Richard N. Draper, V. Faber: The Diameter and Average Distance of Supertoroidal Networks. J. Parallel Distrib. Comput. 31(1): 1-13 (1995)
	1994
3		Fan R. K. Chung, V. Faber, Thomas A. Manteuffel: An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian. SIAM J. Discrete Math. 7(3): 443-457 (1994)
	1984
2		Andrzej Ehrenfeucht, V. Faber, Hal A. Kierstead: A new method of proving theorems on chromatic index. Discrete Mathematics 52(2-3): 159-164 (1984)
	1976
1		Jean-Claude Bermond, V. Faber: Decomposition of the complete directed graph into k-circuits. J. Comb. Theory, Ser. B 21(2): 146-155 (1976)

Coauthor Index

1	Jean-Claude Bermond	[1]
2	Fan R. K. Chung (Fan Chung Graham)	[3]
3	Richard N. Draper	[4]
4	Andrzej Ehrenfeucht	[2]
5	Hal A. Kierstead (Henry A. Kierstead)	[2]
6	J. Liesen	[5]
7	Thomas A. Manteuffel	[3]
8	P. Tichý	[5]