Drawing planar graphs with large vertices and thick edges.
Dual approach to edge distance between graphs
Dual point-partition number of complementary graphs
Dual properties within graph theory
Dualizing cubic graph theory
Důkaz Brouwerovy věty metodou teorie grafů
Dürer polyhedra: the dark side of melancholia
Dürer's engraving Melencolia I famously includes a perspective view of a solid polyhedral block of which the visible portion is an 8-circuit bounding a pentagon-triple+triangle patch. The polyhedron is usually taken to be a cube truncated on antipodal corners, but an infinity of others are compatible with the visible patch. Construction of all cubic polyhedra compatible with the visible portion (i.e., Dürer Polyhedra) is discussed, explicit graphs and symmetries are listed for small cases ( ≤ 18...
Dynamic cage survey.
Dynamic programming as optimal path problem in weighted digraphs.
Dynamic WWW structures in .
Dynamics of Stochastic Neuronal Networks and the Connections to Random Graph Theory
We analyze a stochastic neuronal network model which corresponds to an all-to-all network of discretized integrate-and-fire neurons where the synapses are failure-prone. This network exhibits different phases of behavior corresponding to synchrony and asynchrony, and we show that this is due to the limiting mean-field system possessing multiple attractors. We also show that this mean-field limit exhibits a first-order phase transition as a function...