A compilation of relations between graph invariants

[1]  B. R. Myers,et al.  A lower bound on the chromatic number of a graph , 1971, Networks.

[2]  C. S. Edwards,et al.  Lower bounds for the clique and the chromatic numbers of a graph , 1983, Discret. Appl. Math..

[3]  Nathan Linial.  A lower bound for the circumference of a graph , 1976, Discret. Math..

[4]  B. Bollobás,et al.  Maximal matchings in graphs with given minimal and maximal degrees , 1976 .

[5]  H. B. Walikar,et al.  On domination related concepts in Graph Theory , 1981 .

[6]  R. J. Cook.  Point-Arboricity and Girth , 1974 .

[7]  Norman E. Gibbs,et al.  The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[8]  V B Alekseev,et al.  THE THICKNESS OF AN ARBITRARY COMPLETE GRAPH , 1976 .

[9]  Michael Doob,et al.  Spectra of graphs , 1980 .

[10]  J. Moon,et al.  On the diameter of a graph. , 1965 .

[11]  Vašek Chvátal,et al.  The smallest triangle-free 4-chromatic 4-regular graph , 1970 .

[12]  John Mitchem.  An extension of Brooks' theorem to n-degenerate graphs , 1977, Discret. Math..

[13]  B. Andrásfai,et al.  Über ein Extremalproblem der Graphentheorie , 1962 .

[14]  E. A. Nordhaus,et al.  On Complementary Graphs , 1956 .

[15]  Paul A. Catlin,et al.  Another bound on the chromatic number of a graph , 1978, Discret. Math..

[16]  Ronald D. Dutton,et al.  On clique covers and independence numbers of graphs , 1983, Discret. Math..

[17]  Ronald D. Dutton,et al.  Upper bounds on the edge clique cover number of a graph , 1984, Discret. Math..

[18]  Yousef Alavi,et al.  The connectivity and line-connectivity of complementary graphs , 1971 .

[19]  S. L. Hakimi,et al.  Upper Bounds on the Order of a Clique of a Graph , 1972 .

[20]  L. Beineke,et al.  Inequalities involving the genus of a graph and its thicknesses , 1965, Proceedings of the Glasgow Mathematical Association.

[21]  Richard A. Duke.  On the genus and connectivity of Hamiltonian graphs , 1972, Discret. Math..

[22]  Victor Klee,et al.  Minimum Graphs of Specified Diameter, Connectivity and Valence. I , 1976, Math. Oper. Res..

[23]  G. Chartrand,et al.  The Point‐Arboricity of Planar Graphs , 1969 .

[24]  Gary Chartrand,et al.  The point-arboricity of a graph , 1968 .

[25]  John Adrian Bondy.  Extremal graphs with prescribed covering number , 1978, J. Comb. Theory, Ser. B.

[26]  G. Chartrand.  A Graph-Theoretic Approach to a Communications Problem , 1966 .

[27]  R. Singleton.  There is No Irregular Moore Graph , 1968 .

[28]  M. E. Watkins.  A Lower Bound for the Number of Vertices of a Graph , 1967 .

[29]  Paul Erdös,et al.  On the connection between chromatic number, maximal clique and minimal degree of a graph , 1974, Discret. Math..

[30]  R. J. Cook,et al.  Heawood's theorem and connectivity , 1973 .

[31]  R. J. Cook,et al.  Chromatic number and girth , 1975 .

[32]  I. Tomescu,et al.  Problemes Extremaux Concernant le Nombre Des Colorations des Sommets D’un Graphe Fini , 1975 .

[33]  L. Lovász.  Three short proofs in graph theory , 1975 .

[34]  P. Erdös,et al.  The Representation of a Graph by Set Intersections , 1966, Canadian Journal of Mathematics.

[35]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[36]  Martin Milgram,et al.  Bounds for the genus of graphs with given Betti number , 1977, J. Comb. Theory, Ser. B.

[37]  Alexandr V. Kostochka,et al.  On an upper bound of a graph's chromatic number, depending on the graph's degree and density , 1977, J. Comb. Theory B.

[38]  Béla Bollobás,et al.  The Diameter of Graphs: a survey , 1981 .

[39]  Vasek Chvátal.  Degrees and matchings , 1976 .

[40]  Ioan Tomescu.  Le nombre maximal de colorations d'un graphe hamiltonien , 1976, Discret. Math..

[41]  S. P. Mohanty,et al.  A lower bound on the number of vertices of a graph , 1978 .

[42]  Bill Jackson.  Hamilton cycles in regular graphs , 1978, J. Graph Theory.

[43]  Ronald D. Dutton,et al.  Graphs which, with their complements, have certain clique covering numbers , 1981, Discret. Math..

[44]  Ioan Tomescu.  Sur les cycles élémentaires dans les graphes et hypergraphesk-chromatiques , 1978 .

[45]  R. J. Cook,et al.  Point partition numbers and girth , 1975 .

[46]  John Adrian Bondy,et al.  Large cycles in graphs , 1971, Discret. Math..

[47]  Paul Erdös,et al.  ON THE PRODUCT OF THE POINT AND LINE COVERING NUMBERS OF A GRAPH , 1979 .

[48]  Oystein Ore,et al.  On a graph theorem by dirac , 1967 .