Two sufficient conditions for a graph to be type 1

Lists

Tools

Wu, J. L., Wang, P. and Hilton, A. (2005) Two sufficient conditions for a graph to be type 1. Ars Combinatoria, 76. pp. 47-64.

Full text not archived in this repository.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Item Type:	Article
Divisions:	Science > School of Mathematical, Physical and Computational Sciences > Department of Mathematics and Statistics
ID Code:	5056

Deposit Details

University of Reading