Forbidden graph characterization
Forbidden graph characterization
Describing a family of graphs by excluding certain (sub)graphs.
No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.
No owners yet
Category: Empty
- 0 owners
- 0 copies
- 0 pulls
- Wishlisted
- 0
- In 0 albums
- On 0 showcases
- Market listings
- 0
Not sold on the market yet.
Readers' pathsAug 2026 – Oct 2026
Readers go next to
Share of the 241 clicks on its links
Graph minor
Subgraph with contracted edges.
25%
Kuratowski's theorem
On forbidden subgraphs in planar graphs.
20%
Claw-free graph
Graph without four-vertex star subgraphs.
15%
Line graph
Graph representing edges of another graph.
13%
Complete bipartite graph
Bipartite graph where each node of 1st set is linked to all nodes of 2nd set.
8.3%
Erdős–Hajnal conjecture
Conjecture in graph theory.
5.8%
Outerplanar graph
Non-crossing graph with vertices on outer face.
4.6%
Apex graph
Graph which can be made planar by removing a single node.
4.6%
Readers come from
Share of the 460 readers arriving from another article
Kuratowski's theorem
On forbidden subgraphs in planar graphs.
29%
Planar graph
Graph that can be embedded in the plane.
20%
Line graph
Graph representing edges of another graph.
8.7%
Unit distance graph
Geometric graph with unit edge lengths.
8.3%
Graph minor
Subgraph with contracted edges.
7.2%
Wagner's theorem
On forbidden minors in planar graphs.
2.2%