Premium
𝒢‐constructibility of planar graphs
Author(s) -
Mynhardt C. M.,
Broere I.
Publication year - 1980
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190040304
Subject(s) - combinatorics , mathematics , planar graph , planar , chordal graph , maximal independent set , indifference graph , 1 planar graph , pathwidth , set (abstract data type) , clique sum , discrete mathematics , graph , computer science , line graph , computer graphics (images) , programming language
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.