Math-Co
Pseudo-scheduling: A New Approach to the Broadcast Scheduling Problem
Regular families of forests, antichains and duality pairs of relational structures
Sylvester-Gallai type theorems for approximate collinearity
The crossing number of the generalized Petersen graph P(10, 3) is six
The Cutting Plane Method is Polynomial for Perfect Matchings
The Forwarding Indices of Graphs -- a Survey
The Generation of Fullerenes
The Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs
