Read on Wikipedia

Image: David Eppstein · CC0

Perfect graph

Perfect graph

Graph with tight clique-coloring relation.

Rare
20 views/day0 owners

No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.

No owners yet

RareTop 25%

Category: Empty

0 owners
0 copies
0 pulls
Wishlisted
0
In 0 albums
On 0 showcases
Market listings
0
Wikipedia views per dayLast 30 days 600

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 267 clicks on its links

  1. Graph coloring

    Methodic assignment of colors to elements of a graph.

    34%

  2. Clique (graph theory)

    Adjacent subset of an undirected graph.

    26%

  3. 3-3 duoprism

    Four-dimensional convex polytope.

    9.7%

  4. Perfect graph theorem

    Complements of perfect graphs are perfect.

    9%

Readers come from

Share of the 327 readers arriving from another article

  1. Chordal graph

    Graph where all long cycles have a chord.

    24%

  2. Graph (discrete mathematics)

    Vertices connected in pairs by edges.

    17%

  3. Interval graph

    Intersection graph for intervals on the real number line.

    13%

  4. Graph coloring

    Methodic assignment of colors to elements of a graph.

    7.6%

  5. Line graph

    Graph representing edges of another graph.

    7.6%

  6. Cograph

    Graph formed by complementation and disjoint union.

    4.6%

  7. Perfect graph theorem

    Complements of perfect graphs are perfect.

    3.4%

  8. Cycle (graph theory)

    Trail in which only the first and last vertices are equal.

    3.1%