𝒢‐constructibility of planar graphs

Christina M. Mynhardt, Izak Broere ¡ Journal of Graph Theory ¡ 1980

Abstract In this paper, the concept of the 𝒢‐constructibility of graphs is introduced and investigated with particular reference to planar graphs. It is conjectured that the planar graphs are minimally N‐constructible, where N is a finite set of graphs and an infinite set 𝒢 is obtained such that the planar graphs are also minimally 𝒢‐constructible. Finally, some properties of the set of all N‐constructible graphs are discussed and compared with the corresponding properties of planar graphs.

Read the paper ¡ More papers on PaperTik