Graphtrials: visual proofs of graph properties
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2123122 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1366029 (Why is no real title available?)
- scientific article; zbMATH DE number 2001186 (Why is no real title available?)
- scientific article; zbMATH DE number 1550516 (Why is no real title available?)
- A heuristic approach towards drawings of graphs with high crossing resolution
- A proof of the four color theorem
- An algorithm for drawing general undirected graphs
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Certifying algorithms
- ChordLink: a new hybrid visualization model
- Collective dynamics of `small-world' networks
- Computational Complexity
- On the edge-length ratio of outerplanar graphs
- On the edge-length ratio of outerplanar graphs
- Philosophy of mathematics. A contemporary introduction to the world of proofs and pictures
- Stress-Plus-X (SPX) graph layout
This page was built for publication: Graphtrials: visual proofs of graph properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920467)