Definition 1.2. A graph is said to be a truly non-trivial graphoidal graph (TNTG graph) if it possesses a TNT graphoidal cover. For the graph ...
確定! 回上一頁