Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

Dürer graph

In the mathematical field of graph theory, the Dürer graph is an undirected graph with 12 vertices and 18 edges. It is named after Albrecht Dürer, whose 1514 engraving Melencolia I includes a depiction of Dürer's solid, a convex polyhedron having the Dürer graph as its skeleton. Dürer's solid is one of only four well-covered simple convex polyhedra.

Graph-theoretic properties, Dürer's solid & Symmetries

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around Dürer graph. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Key facts & relationships

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Automorphisms
12 (D6)
Chromatic index
3
Chromatic number
3
Diameter
4
Edges
18
Girth
3

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Dürer's solid

Graph-theoretic properties

Symmetries

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Dürer graph

Nodes43
Edges42
Triples29
Avg. degree1.95
Density0.046512
Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Dürer graph

Top relations

related to Graph-theoretic properties · 8
Dürer graph → As, Dürer, Dürer's, It, Petersen, The, The Dürer, Y-Δ
is a · 4
Dürer graph → 3-vertex-connected simple planar graph.The Dürer graph is a well-covered graph, graph formed by the vertices and edges of the Dürer solid, undirected graph with 12 vertices and 18 edges, unit distance graph
related to Gallery · 4
Dürer graph → Dürer, Hamiltonian, The, The Dürer
related to Symmetries · 3
Dürer graph → D6, Dürer, The
Automorphisms · 1
Dürer graph → 12 (D6)
Chromatic index · 1
Dürer graph → 3
Chromatic number · 1
Dürer graph → 3
Diameter · 1
Dürer graph → 4
Edges · 1
Dürer graph → 18
Girth · 1
Dürer graph → 3

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

graph dürer solid well-covered dürer's vertices graphs convex hamiltonian mr simple cubic planar 12 edges journal polyhedron four cube doi

Entity relationships Subject–Predicate–Object triples

SubjectPredicateObjectConfidenceSrc
Dürer graphAutomorphisms12 (D6)1.00infobox
Dürer graphChromatic index31.00infobox
Dürer graphChromatic number31.00infobox
Dürer graphDiameter41.00infobox
Dürer graphEdges181.00infobox
Dürer graphGirth31.00infobox
Dürer graphNamed afterAlbrecht Dürer1.00infobox
Dürer graphPropertiesCubic Planar Unit distance Well-covered1.00infobox
Dürer graphRadius31.00infobox
Dürer graphVertices121.00infobox
Dürer graphis aundirected graph with 12 vertices and 18 edges0.90text
Dürer graphis agraph formed by the vertices and edges of the Dürer solid0.90text
Dürer graphis a3-vertex-connected simple planar graph.The Dürer graph is a well-covered graph0.90text
Dürer graphis aunit distance graph0.90text

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    Min side: 3
    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.