The following pages link to Discrete Mathematics (Q175483):
Displaying 50 items.
- Some special Vapnik-Chervonenkis classes (Q1152158) (← links)
- Disjoint cliques and disjoint maximal independent sets of vertices in graphs (Q1168336) (← links)
- On maximally saturated graphs (Q1169471) (← links)
- A combinatorial application of matrix Riccati equations and their q- analogue (Q1170193) (← links)
- Comparability graphs and intersection graphs (Q1172652) (← links)
- Trees with 1-factors and oriented trees (Q1174177) (← links)
- Size and connectivity of the \(k\)-core of a random graph (Q1179277) (← links)
- \(p\)-integral harmonic sums (Q1182862) (← links)
- A note on a stochastic model for the incubation of transfusion-associated AIDS (Q1182927) (← links)
- Balanced directed cycle designs based on groups (Q1182947) (← links)
- A brief review on Egmont Köhler's mathematical work (Q1183961) (← links)
- The signed Eulerian numbers (Q1191941) (← links)
- The medial graph and voltage-current duality (Q1196985) (← links)
- Julius Petersen 1839--1910. A biography (Q1198638) (← links)
- Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph (Q1199584) (← links)
- A formula for the number of Latin squares (Q1208376) (← links)
- On computing the length of longest increasing subsequences (Q1219686) (← links)
- A Catalan triangle (Q1224098) (← links)
- On the ratio of optimal integral and fractional covers (Q1224109) (← links)
- On metrizability of the free monoids (Q1230512) (← links)
- On additive partitions of integers (Q1245861) (← links)
- On acyclic colorings of planar graphs (Q1257487) (← links)
- On topologies generated by Moisil resemblance relations (Q1260388) (← links)
- On the construction of balanced Room squares (Q1292812) (← links)
- Every circle graph of girth at least 5 is 3-colourable (Q1296984) (← links)
- Balanced cycles and holes in bipartite graphs (Q1297428) (← links)
- Moments of Dyck paths (Q1300968) (← links)
- Faster random generation of linear extensions (Q1301730) (← links)
- The order dimension of the complete graph (Q1301733) (← links)
- Maximizing Möbius functions on subsets of Boolean algebras (Q1318819) (← links)
- Random Ramsey graphs for the four-cycle (Q1318835) (← links)
- Riordan arrays and combinatorial sums (Q1336667) (← links)
- Coin graphs, polyhedra, and conformal mapping (Q1339871) (← links)
- The generating function of convex polyominoes: The resolution of a \(q\)- differential system (Q1343776) (← links)
- Realizability and uniqueness in graphs (Q1344609) (← links)
- On the diameter of the rotation graph of binary coupling trees (Q1348109) (← links)
- On the recognition of de Bruijn graphs and their induced subgraphs (Q1348115) (← links)
- Towards a characterisation of Pfaffian near bipartite graphs (Q1349098) (← links)
- Triple loop networks with small transmission delay (Q1356442) (← links)
- A minor-monotone graph parameter based on oriented matroids (Q1356746) (← links)
- Dirac's conjecture on \(K_ 5\)-subdivisions (Q1356785) (← links)
- A lower bound on the probability of a union (Q1357742) (← links)
- Building counterexamples (Q1363703) (← links)
- On the rank of a matrix associated with a graph. (Q1422421) (← links)
- On the choice number of claw-free perfect graphs (Q1422425) (← links)
- On the cut polyhedron. (Q1426123) (← links)
- The Kadison-Singer problem in discrepancy theory. (Q1427482) (← links)
- Classification and characterizations of snarks (Q1584327) (← links)
- On hypergraphs without loose cycles (Q1699534) (← links)
- New lower bounds on 2-spontaneous emission error designs (Q1727795) (← links)
