Linked from

The 19 pages that link to Multigraph, each with the reason it gives.

• Directed graphRelated: Directed multigraphs allow several distinct arrows between the same ordered endpoints.

• Graph (discrete mathematics)Broader topic: Parallel edges let a model represent several distinct relationships between two vertices.

• Edge (graph theory)Compared with: It allows distinct edges to represent repeated connections between the same vertices.

• Vertex (graph theory)Compared with: Parallel edges can connect the same vertices without making them distinct.

• Degree (graph theory)Related: Each parallel edge contributes separately to endpoint degrees.

• HypergraphCompared with: Parallel pairwise edges differ from a single edge joining many vertices.

• Simple graphCompared with: It differs from a simple graph by allowing parallel edges.

• Line graphCompared with: Parallel original edges become adjacent vertices, unlike a simple-graph-only treatment.

• Weighted graphCompared with: Parallel edges alter connection structure; weights alone do not create additional edges.

• Adjacency listRelated: Its lists can represent repeated neighbors or require edge identifiers to distinguish parallel edges.

• Undirected graphRelated: Undirected graphs may allow parallel edges when their definition permits them.

• Handshaking lemmaCompared with: The identity still counts parallel edges separately, so the same proof applies.

• Seven Bridges of KönigsbergRelated: Several pairs of Königsberg landmasses were joined by more than one bridge.

• Vizing's theoremNarrower topic: Vizing’s theorem relies on simplicity; multigraphs require different bounds.

• Degree matrixCompared with: Parallel edges increase degree entries, unlike simple-graph adjacency conventions.

• Edge contractionRelated: Contraction can create parallel edges when endpoint neighborhoods overlap.

• Directed networkCompared with: Multiplicity concerns repeated links, a separate property from their orientation.

• Goldberg–Seymour conjectureNarrower topic: The conjecture concerns edge coloring in graphs that may have parallel edges.

• List coloring conjectureNarrower topic: The conjecture’s claim covers multigraphs, not only simple graphs.