Titlebook: ;

abstemious

A survey of the reconstruction conjecture,rom a given deck of cards, each containing just one point-deleted subgraph of G, we proceed to derive information about G which is deducible from this deck..Various theorems proving the RC for trees are then taken up. The status of the RC for digraphs is reported. Several variations of the RC are st

灯丝

Which graphs have integral spectra?, that certain graphs have an integral spectrum, i.e., every eigenvalue is an integer. Thus, it is natural to ask just which graphs have this property. We develop a systematic approach to this question based on operations on graphs. The general problem appears intractable.

STING

Generalized ramsey theory for graphs - a survey,This survey paper will emphasize the following class of problems: Given graphs G., ..., G., determine or estimate the Ramsey number r(G., ..., G.), the smallest number p such that if the lines of a complete graph K. are c-colored in any manner, then for some j there exists a subgraph in color j whic

homeostasis

空中

A survey of finite embedding theorems for partial latin squares and quasigroups,ow and column each of the integers 1,2,...,n occurs .. An example of a 4 × 4 partial latin square is given below..An immediate observation shows that the partial latin square P cannot be completed to a latin square; i.e., the empty cells cannot be filled in with numbers from the set {1,2,3,4} so tha

讨好女人

linear

一夫一妻制

宠爱

On covering the points of a graph with point disjoint paths,er well-known graphical invariants is discussed, and ζ is evaluated for a variety of special classes of graphs. A simple algorithm is developed for determining ζ in the case of a tree, and it is shown that this tree algorithm can be generalized to yield ζ for any connected graph. Degree conditions a

肮脏

A useful family of bicubic graphs, from this 2n-gon by adjunction of the chords (i,(i+m)′), i = 0, 1, 2, ..., n−1, the addition being taken modulo n. Restricting ourselves to the case when n is prime, we determine the isomorphism classes of the graphs G(n,m), and the corresponding automorphism groups. Various applications are discus