Mathematics - UQ reSEARCHers (Publications)

	Publication

2002	Bryant, DE and Fu, HL (2002) C4-saturated bipartite graphs. Discrete Mathematics, 259 1-3: 263-268.
	Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgraph of K with the property that for any edge e is an element of E(K)\E(G), G boolean OR {e} is not H-free. We present some general results on K-s,K-t-saturated subgraphs of the complete bipartite graph K-m,K-n and study the problem of finding, for all possible values of q, a C-4-saturated subgraph of K., having precisely q edges. (C) 2002 Elsevier Science B.V. All rights reserved.
	Professor Darryn Bryant
eSpace Record:	http://espace.library.uq.edu.au/view/UQ:38822

Keywords:	Mathematics