Thesis (MSc)--University of Stellenbosch, 2007. / Bibliography. Also available via the Internet.

Thesis (PhD) - Swinburne University of Technology, School of Information Technology, 2004. / A dissertation submitted to the School of Information Technology, Swinburne University of Technology for the award of Doctor of Philosophy - 2004. Typescript. Bibliography: p. [180]-192.

Thesis (Ph. D.)--Ohio State University, 2008. / Title from first page of PDF file. Includes bibliographical references (p. 345-346).

Thesis (Ph. D.)--University of Hong Kong, 2009. / Includes bibliographical references (p. 189-194) Also available in print.

Thesis (M.Ed.)--University of Hong Kong, 2001. / Includes bibliographical references (leaves 147-156). Also available in print.

Thesis (Ph. D. in Electrical Engineering)--Vanderbilt University, Aug. 2006. / Title from title screen. Includes bibliographical references.

Thesis (PhD (Education))--University of Stellenbosch, 1998. / This dissertation deals with typical, widespread student errors with respect to kinematic graphs as revealed by a literature survey, as well as an own empirical investigation into the nature and extent of these misconceptions. The fact that certain misconceptions turned out to be more widespread than initially believed, has serious consequences for educators' assumptions about students' understanding of graphs in general, as well as their ideas on how to minimise some generally occurring "alternative views on graphs". Students' graphing skills are analysed and described in terms of a number of translations between various representations of physical events involving motion. A special focus is placed on graph transformations, which are translations from one graphical representation to another. It turned out that this provides valuable information about a learner's graphing skills, as well as his understanding of the relevant kinematic quantities and conventions required to make successful transformations.

D. Phil (Mathematics) / In this thesis we investigate generalized chromatic numbers in the context of hereditary graph properties. We also investigate the general topic of invariants of graphs as well as graph properties. In Chapter 1 we give relevant definitions and terminology pertaining to graph properties. In Chapter 2 we investigate generalized chromatic numbers of some well-known additive hereditary graph properties. This problem necessitates the investigation of reducible bounds. One of the results here is an improvement on a known upper bound for the path partition number of the property Wk. We also look at the generalized chromatic number of infinite graphs and hereby establish the connection between the generalized chromatic number of properties and infinite graphs. In Chapter 3 the analogous question of the generalized edge-chromatic number of some well-known additive hereditary properties is investigated. Similarly we find decomposable bounds and are also able to find generalized edge-chromatic numbers of properties using some well-known decomposable bounds. In Chapter 4 we investigate the more general topic of graph invariants and the role they play in chains of graph properties and then conversely the invariants that arise from chains of graph properties. Moreover we investigate the effects on monotonicity of the invariants versus heredity and additivity of graph properties. In Chapter 5 the general topic of invariants of graph properties defined in terms of the set of minimal forbidden subgraphs of the properties is studied. This enables us to investigate invariants so defined on binary operations between graph properties. In Chapter 6 the notion of natural and near-natural invariants are introduced and are also studied on binary operations of graph properties. The set of minimal forbidden subgraphs again plays a role in the definition of invariants here and this then leads us to study the completion number of a property.

Note:

No description available.