Two sufficient conditions for a graph to be type 1

Full text not archived in this repository.

Please see our End User Agreement.

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

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

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.

Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/5056
Divisions Science > School of Mathematical, Physical and Computational Sciences > Department of Mathematics and Statistics
Download/View statistics View download statistics for this item
Full text not archived in this repository.
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Please see our End User Agreement.

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

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar