你即將離開本站

並前往https://web.math.princeton.edu/~mchudnov/edgeunion.pdf

Cliques in the union of graphs - Princeton Math

A clique in a graph is a set of pairwise adjacent vertices. A subset U ⊆ V is obedient if U is the union of a clique of B and a clique of R. Our first result ...

確定！ 回上一頁

查詢 「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.