From Wikipedia, the free encyclopedia
Introduction
Graph drawing – Visualization of node-link graphsGraph theory – Area of discrete mathematicsData and information visualization – Visual representation of dataUndirected graph layouts
Undirected graph – Vertices connected in pairs by edgesArc diagram – Graph drawing with vertices on a lineCircular layout – Graph drawing with vertices on a circleForce-directed graph drawing – Physical simulation to visualize graphsSpectral layout – Graph drawing using eigenvector coordinatesStress majorization – Geometric placement based on ideal distancesDirected graph layouts
Directed graph – Graph with oriented edgesDirected acyclic graph – Directed graph with no directed cyclesDominance drawing – Graph where coordinates show reachabilityLayered graph drawing – Graph drawing with vertices in horizontal layersUpward planar drawing – Graph with edges non-crossing and upwardTree layouts
Tree – Undirected, connected and acyclic graphH tree – Right-angled fractal canopyHyperbolic tree – Mathematical tree in the hyperbolic planeRadial tree – Mathematical tree on concentric circlesTreemapping – Visualisation method for hierchical dataApplication-specific graph drawings
Cartogram – Map distorting size to show another valueConcept map – Diagram showing relationships among conceptsDendrogram – Diagram with a treelike structureDessin d'enfant – Graph drawing used to study Riemann surfacesHasse diagram – Visual depiction of a partially ordered setSociogram – Graphic representation of social linksState diagram – Diagram of behavior of finite state systemsSyntax diagram – Visual description of context-free grammarQuality criteria
Angular resolution – Sharpest angle between edges at a vertexArea – Size of bounding box of graph drawingBend minimization – Graph drawing with few edge bendsCrossing number – Fewest edge crossings in drawing of a graphSlope number – Number of edge slopes in graph drawingPlanar graphs
Planar graph – Graph that can be embedded in the planeDual graph – Graph representing faces of another graphFáry's theorem – Planar graphs have straight drawingsHarborth's conjecture – On graph drawing with integer edge lengthsMedial graph – Edge-face adjacencies in another graphTutte embedding – Planar graph drawn by relaxing springsConvex drawing – Planar graph with convex polygon facesUniversal point set – Points usable to draw any planar graphPlanarity testing
Planarity testing – Algorithmic problem of finding non-crossing drawingsLeft-right planarity test – Depth-first characterization of planar graphsHanani–Tutte theorem – On parity of crossings in graph drawingsKuratowski's theorem – On forbidden subgraphs in planar graphsMac Lane's planarity criterion – On cycle bases of planar graphsSchnyder's theorem – Order dimension of incidences in planar graphsWagner's theorem – On forbidden minors in planar graphsWhitney's planarity criterion – Characterization of planar graphs by matroidsClasses of planar graphs
Apollonian network – Graph formed by subdivision of trianglesCactus graph – Mathematical tree of cyclesHalin graph – Mathematical tree with cycle through leavesOuterplanar graph – Non-crossing graph with vertices on outer faceNested triangles graph – Planar graph used as counterexampleSeries–parallel graph – Recursively-formed graph with two terminal verticesSquaregraph – Planar graph with quadrilateral facesst -planar graphSubhamiltonian graph – Subgraph of planar graph with Hamiltonian cycleWheel graph – Cycle graph plus universal vertexBeyond planarity
Planarization – Technique for drawing non-planar graphs1-planar graph – graph that can be drawn in the Euclidean plane in such a way that each edge has at most one crossing point with a single additional edgePages displaying wikidata descriptions as a fallback Apex graph – Graph which can be made planar by removing a single nodeBook embedding – Graph layout on multiple half-planesClustered planarity Graph embedding – Embedding a graph in a topological space, often EuclideanGreedy embedding Linkless embedding – Embedding a graph in 3D space with no cycles interlinkedRAC drawing – Graph theory representationSimultaneous embedding – technique in graph drawingPages displaying wikidata descriptions as a fallback Strangulated graph – Graph whose peripheral cycles are all trianglesThickness (graph theory) – Number of planar subgraphs to cover a graphTopological graph theory – Branch of the mathematical field of graph theoryToroidal graph – Graph able to be embedded on a torusContact and intersection representations
Intersection graph – Graph representing intersections between given setsBoxicity – Smallest dimension where a graph can be represented as an intersection graph of boxesCircle graph – Intersection graph of a chord diagramCircle packing theorem – Describes the possible tangency relations between circles with disjoint interiorsInterval graph – Intersection graph for intervals on the real number lineScheinerman's conjecture – Mathematics theoremString graph – Intersection graph for curves in the planeUnit disk graph – Intersection graph of unit disks in the planeOther geometric representations of graphs
Geometric graph theory – Subfield of graph theoryMatchstick graph – Graph with edges of length one, able to be drawn without crossingsPolyhedral graph – Graph made from vertices and edges of a convex polyhedronSteinitz's theorem – Graph-theoretic description of polyhedraUnit distance graph – Geometric graph with unit edge lengthsVisibility graph Computer representations of graphs and drawings
Graph (abstract data type) – Abstract data type in computer scienceAdjacency list – Data structure representing a graphAdjacency matrix – Square matrix used to represent a graph or networkDOT (graph description language) – File formatDoubly connected edge list – data structure to represent an embedding of a planar graph in the plane, and polytopes in 3DPages displaying wikidata descriptions as a fallback GraphML LCF notation – Representation of cubic graphsRotation system Algorithmic components
Biconnected components and BC trees – Maximal biconnected subgraphBipolar orientation – acyclic orientation with exactly one source and sinkPages displaying wikidata descriptions as a fallback Coffman–Graham algorithm – Method for partitioning partial orders into levelsExistential theory of the reals – Quantified formulas with real-number variablesHeavy path decomposition PQ tree – data structure for representing families of permutationsPages displaying wikidata descriptions as a fallback SPQR tree – Representation of a graph's triconnected componentsTrémaux tree – Generalization of depth-first search treesGraph drawing software
Gephi – Network analysis and visualization software packageGraphviz – Software package for graph visualizationJUNG – open-source graph modeling and visualization framework written in JavaPages displaying wikidata descriptions as a fallback Meurs Challenger – online graph visualization programPages displaying wikidata descriptions as a fallback Microsoft Automatic Graph Layout – Software libraryyEd – Diagramming program
