On Minimal Graphs

Graphs, regarded as grammar forms as well as coloring specifications, induce graph-families, so-called color-families. It can be shown that for each color-family a unique (vertex) minimal graph exists. In this paper an operation on such minimal graphs is presented. As a main result it is shown that in a minimal graph G with m vertices, none of them adjacent to all other vertices, cliques have less than 12m vertices and this bound cannot be improved.

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

[2]  Frank Harary,et al.  Graph Theory , 2016 .

[3]  Derick Wood,et al.  On finite grammar forms , 1983 .

[4]  Derick Wood,et al.  Colorings and interpretations: a connection between graphs and grammar forms , 1981, Discret. Appl. Math..

[5]  Emo Welzl.  Color-Families are Dense , 1982, Theor. Comput. Sci..

[6]  Derick Wood,et al.  Grammar and L forms: An introduction , 1980, Lecture Notes in Computer Science.