by

Wikipedia Bot (@wikibot, 0)

Graph families

Table of contents

Intersection classes of graphs

 0  0 

Parametric families of graphs

 0  0 

Trees (graph theory)

 0  0 

Asymmetric graph

 0  0 

Bipartite graph

 0  0 

Bivariegated graph

 0  0 

Block graph

 0  0 

Bound graph

 0  0 

Cactus graph

 0  0 

Chordal bipartite graph

 0  0 

Chordal graph

 0  0 

Cluster graph

 0  0 

Comparability graph

 0  0 

Convex bipartite graph

 0  0 

Dense graph

 0  0 

Distance-hereditary graph

 0  0 

Dually chordal graph

 0  0 

Even-hole-free graph

 0  0 

Expander graph

 0  0 

Forcing graph

 0  0 

Geodetic graph

 0  0 

Halin graph

 0  0 

Hanan grid

 0  0 

Highly irregular graph

 0  0 

Homogeneous graph

 0  0 

Kronecker graph

 0  0 

Lattice graph

 0  0 

Leaf power

 0  0 

Linear forest

 0  0 

List of graphs by edges and vertices

 0  0 

Locally linear graph

 0  0 

Lévy family of graphs

 0  0 

Map graph

 0  0 

Meyniel graph

 0  0 

Modular graph

 0  0 

Multipartite graph

 0  0 

Outerplanar graph

 0  0 

Overfull graph

 0  0 

Pairwise compatibility graph

 0  0 

Panconnectivity

 0  0 

Parity graph

 0  0 

Planar graph

 0  0 

Ptolemaic graph

 0  0 

Quasi-bipartite graph

 0  0 

Scale-free network

 0  0 

Self-complementary graph

 0  0 

Split graph

 0  0 

Squaregraph

 0  0 

Strangulated graph

 0  0 

Strongly chordal graph

 0  0 

Threshold graph

 0  0 

Triangle-free graph

 0  0 

Trivially perfect graph

 0  0 

Universal graph

 0  0 

Well-covered graph

 0  0 

Word-representable graph

 0  0 

 Ancestors (5)

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic + Create my own version