PROOF TECHNIQUES IN GRAPH THEORY

Contents: The four color conjecture and other graphical diseases; Several proofs of the number of labeled 2-dimensional trees; On the chromatic number of permutation graphs; The expanding unicurse; Problems and results in chromatic graph theory; Forbidden subgraphs; A proof technique in graph theory; Independence and covering numbers of line graphs and total graphs; The decline and fall of Zarankiewicz's Theorem; On the intersection number of a graph; On endomorphisms of graphs and their homomorphic images; Counterexamples in the theory of well-quasi-ordered sets; On the existence of certain minimal regular n-systems with given girth; Reconstruction of unicyclic graphs; The group of a graph whose adiacency matrix has all distinct eigenvalues; Extremal nonseparable graphs of diameter 2; A class of strongly regular graphs; The exponentiation group as the automorphism group of A graph; Remarks on the Heawood conjecture; Indifference graphs; Enumeration of Euler graphs; A graph-theoretical model for periodic discrete structures; Even and odd 4-colorings; A theorem on Tait colorings with an application to the generalized Petersen graphs; The Mobius function in combinatorial analysis and chromatic graph theory; and Key-word indexed bibliography of graph theory.
Proceedings of the Ann Arbor Graph Theory Conference (2nd), Feb 68.