Relaxed chromatic numbers of graphs

Given any family of graphsP, theP chromatic number _p (G) of a graphG is the smallest number of classes into whichV(G) can be partitioned such that each class induces a subgraph inP. We study this for hereditary familiesP of two broad types: the graphs containing no subgraph of a fixed graphH, and the graphs that are disjoint unions of subgraphs ofH. We generalize results on ordinary chromatic number and we computeP chromatic number for special choices ofP on special classes of graphs.Research supported in part by ONR Grant N00014-85K0570 and by a grant from the University of Illinois Research Board.     

An examination of intermolecular and intramolecular hydrogen bonding in biomolecules by AM1 and MNDO/M semiempirical molecular orbital studies

The recent NMDO/M modification and parameterization of the MNDO molecular orbital method has been used to analyze intermolecular hydrogen bonding between amino acids and water, and intramolecular hydrogen bonding in monosaccharides. The results have been compared to AM1 calculations on the same systems. The MNDO/M calculations gave values which were similar to ab initio calculations with respect to the intermolecular interactions, but yielded significantly poorer results for the intramolecular interactions. The AM1 procedure performed better on the intramolecular interactions than the MNDO/M procedure, but frequently provided unfavorable three-centered hydrogen bonding geometries for the intermolecular interactions.