graph-operations
Articles
- Clique graphGraph representing structure of another graph's cliques
- MycielskianDerived graph of higher chromatic number
- Medial graphEdge-face adjacencies in another graph
- Clique-sumGluing graphs at complete subgraphs
- Graph operationsProcedures for constructing new graphs in graph theory
- Disjoint union of graphsBinary operation combining the vertex and edge sets of two graphs
- Simplex graphGraph representing connectivity between cliques of another graph
- Edge contractionDeleting a graph edge and merging its nodes
- Medial graphEdge-face adjacencies in another graph
- Clique graphGraph representing structure of another graph's cliques
- Clique graphGraph representing structure of another graph's cliques
- Complement graphGraph with same nodes as but complementary connections to another
- Medial graphEdge-face adjacencies in another graph
- MycielskianDerived graph of higher chromatic number
- Hajós constructionGraph operation
- MycielskianDerived graph of higher chromatic number
- Graph powerGraph of short distances in another graph
- Clique graphGraph representing structure of another graph's cliques
- MycielskianDerived graph of higher chromatic number
- Medial graphEdge-face adjacencies in another graph
- Clique graphGraph representing structure of another graph's cliques
- MycielskianDerived graph of higher chromatic number
- Clique-sumGluing graphs at complete subgraphs
- Medial graphEdge-face adjacencies in another graph
- Bipartite double coverDerived bipartite graph with twice as many nodes as the original graph
- Transpose graphDirected graph with reversed edges