🏛️ The Discrete Mathematics Crypt
cs.DM: Where Discrete Mathematics papers rest without their code.
585
Total Papers
0
No Code
568
Twilight
17
Has Code
2.9%
Survival Rate
🔮
🔮
The Ethereal
🔮
🔮
The Ethereal
On 3-Coloring Circle Graphs
🔮
🔮
The Ethereal
Graph Search Trees and Their Leaves
🔮
🔮
The Ethereal
Maximum edge colouring problem on graphs that exclude a fixed minor
🔮
🔮
The Ethereal
Stretch-width
🔮
🔮
The Ethereal
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
🔮
🔮
The Ethereal
Bounds of the sum of edge lengths in linear arrangements of trees
🔮
🔮
The Ethereal
Burning Geometric Graphs
🔮
🔮
The Ethereal
An explicit construction of graphs of bounded degree that are far from being Hamiltonian
🔮
🔮
The Ethereal
A Linear Time Algorithm for Computing the Eternal Vertex Cover Number of Cactus Graphs
🔮
🔮
The Ethereal
Reappraising the distribution of the number of edge crossings of graphs on a sphere
🔮
🔮
The Ethereal
Edge corona product as an approach to modeling complex simplical networks
🔮
🔮
The Ethereal
The Lexicographic Method for the Threshold Cover Problem
🔮
🔮
The Ethereal
The Minimization of Random Hypergraphs
🔮
🔮
The Ethereal
Classification of linear codes using canonical augmentation
🔮
🔮
The Ethereal
The simultaneous conjugacy problem in the symmetric group
🔮
🔮
The Ethereal
Fast Computing the Algebraic Degree of Boolean Functions
🔮
🔮
The Ethereal
Fake news and rumors: a trigger for proliferation or fading away
🔮
🔮
The Ethereal
The Lattice Structure of Linear Subspace Codes
🔮
🔮
The Ethereal
Planar Steiner Orientation is NP-complete
🔮
🔮
The Ethereal
Structure Entropy and Resistor Graphs
🔮
🔮
The Ethereal
An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs
🔮
🔮
The Ethereal
Fast algorithms for anti-distance matrices as a generalization of Boolean matrices
🔮
🔮
The Ethereal