你即將離開本站

並前往https://klein.mit.edu/~djk/18.310/18.310F04/some_graph_theory.html

14. Some Graph Theory - MIT Mathematics

If the coloring number and clique number are the same for every induced subgraph of G, we call G a perfect graph. The complement of a graph G is the graph on ...

確定！ 回上一頁

查詢 「Clique graph」的人也找了：

  1. clique定義
    2.
  2. Clique graph
    3.
  3. clique演算法
    4.
  4. Clique NP-complete
    5.
  5. Clique number
    6.
  6. N clique
    7.
  7. Clique problem
    8.
  8. Clique cover
    9.