# Category:Graph families

Here is a list of articles in the category **Graph families** of the Computing portal that unifies foundations of mathematics and computations using computers. This category contains articles about collections of graphs either defined by some specific property, or decorated by some additional combinatorial information, and sufficiently notable to have a name. See set families for related families of non-graph combinatorial objects, graphs for individual graphs and graph families parametrized by a small number of numeric parameters, and graph theory for more general information about graph theory.

*See also Category:Graph operations for graphs distinguished for the specific way of their construction*

Please keep in mind that a particular graph may fall in several families and some families themselves may contain subfamilies, sometimes with a rather different definition.

## Subcategories

This category has the following 5 subcategories, out of 5 total.

### I

### P

### R

### T

## Pages in category "Graph families"

The following 118 pages are in this category, out of 118 total.

### *

- Gallery of named graphs
*(computing)* - List of graphs
*(computing)* - List of graphs by edges and vertices
*(computing)*

### A

- Antiprism graph
*(computing)* - Aperiodic graph
*(computing)* - Apex graph
*(computing)* - Apollonian network
*(computing)* - Asymmetric graph
*(computing)*

### B

- Biased graph
*(computing)* - Biclique-free graph
*(computing)* - Biconnected graph
*(computing)* - Bipartite graph
*(computing)* - Bivariegated graph
*(computing)* - Block graph
*(computing)* - Bound graph
*(computing)*

### C

- Cactus graph
*(engineering)* - Cage (graph theory)
*(computing)* - Cayley graph
*(computing)* - Chordal bipartite graph
*(computing)* - Chordal graph
*(computing)* - Circulant graph
*(computing)* - Claw-free graph
*(computing)* - Cluster graph
*(computing)* - Cograph
*(computing)* - Comparability graph
*(computing)* - Conference graph
*(computing)* - Contact graph
*(computing)* - Convex bipartite graph
*(computing)* - Cop-win graph
*(computing)* - Critical graph
*(computing)* - Cubic graph
*(computing)*

### D

- Dense graph
*(computing)* - Descartes snark
*(computing)* - Disperser
*(computing)* - Distance-hereditary graph
*(computing)* - Distance-regular graph
*(computing)* - Distance-transitive graph
*(computing)* - Domination perfect graph
*(computing)* - Dually chordal graph
*(computing)*

### E

- Edge-transitive graph
*(computing)* - Even-hole-free graph
*(computing)* - Expander graph
*(computing)* - Extractor (mathematics)
*(computing)*

### F

- Factor-critical graph
*(computing)* - Forbidden graph characterization
*(computing)*

### H

- Half-transitive graph
*(computing)* - Halin graph
*(computing)* - Hanan grid
*(computing)* - Highly irregular graph
*(computing)* - Homogeneous graph
*(computing)* - Hypohamiltonian graph
*(computing)*

### I

- Implication graph
*(computing)* - Integral graph
*(computing)*

### K

- K-edge-connected graph
*(computing)* - K-tree
*(computing)* - K-vertex-connected graph
*(computing)* - Kronecker graph
*(computing)*

### L

- Laman graph
*(computing)* - Lattice graph
*(computing)* - Leaf power
*(computing)* - Lévy family of graphs
*(computing)* - Line graph
*(computing)* - Line graph of a hypergraph
*(computing)* - Linear forest
*(computing)* - Locally linear graph
*(computing)*

### M

- Map graph
*(computing)* - Medial graph
*(computing)* - Median graph
*(computing)* - Meyniel graph
*(computing)* - Modular graph
*(computing)* - Moore graph
*(computing)* - Multipartite graph
*(computing)*

### N

- Null graph
*(computing)*

### O

- Outerplanar graph
*(computing)* - Overfull graph
*(computing)*

### P

- Panconnectivity
*(computing)* - Pancyclic graph
*(computing)* - Parity graph
*(computing)* - Partial cube
*(computing)* - Partial k-tree
*(computing)* - Petersen family
*(computing)* - Planar graph
*(computing)* - Platonic graph
*(computing)* - Polytope graph
*(computing)* - Prism graph
*(computing)* - Pseudoforest
*(computing)* - Ptolemaic graph
*(computing)*

### Q

- Quartic graph
*(computing)* - Quasi-bipartite graph
*(computing)*

### R

- Ramanujan graph
*(computing)* - Reeb graph
*(computing)* - Regular graph
*(computing)*

### S

- Scale-free network
*(computing)* - Self-complementary graph
*(computing)* - Semi-symmetric graph
*(computing)* - Series-parallel graph
*(computing)* - Simplex graph
*(computing)* - Skew-symmetric graph
*(computing)* - Small-world network
*(computing)* - Snark (graph theory)
*(computing)* - Split graph
*(computing)* - Squaregraph
*(computing)* - Strangulated graph
*(computing)* - Strongly chordal graph
*(computing)* - Strongly regular graph
*(computing)* - Subhamiltonian graph
*(computing)* - Symmetric graph
*(computing)*

### T

- Threshold graph
*(computing)* - Toroidal graph
*(computing)* - Triangle-free graph
*(computing)* - Trivially perfect graph
*(computing)*

### U

- Universal graph
*(computing)*

### V

- Vertex-transitive graph
*(computing)*

### W

- Walk-regular graph
*(computing)* - Well-colored graph
*(computing)* - Well-covered graph
*(computing)* - Word-representable graph
*(computing)*

### Z

- Zero-symmetric graph
*(computing)*