The following pages link to Combinatorica (Q168579):
Displaying 50 items.
- A topological approach to evasiveness (Q1065831) (← links)
- Inverses of trees (Q1066161) (← links)
- Linear verification for spanning trees (Q1066909) (← links)
- Extremal hypergraph problems and convex hulls (Q1066910) (← links)
- An Erdős-Gallai conjecture (Q1068106) (← links)
- On the sum of the reciprocals of cycle lengths in sparse graphs (Q1068848) (← links)
- The struction of a graph: Application to CN-free graphs (Q1068855) (← links)
- On a problem of Spencer (Q1072210) (← links)
- Sequential access in splay trees takes linear time (Q1072706) (← links)
- A problem of P. Seymour on nonbinary matroids (Q1076027) (← links)
- Computing the genus of the 2-amalgamations of graphs (Q1076031) (← links)
- Independent sets in k-chromatic graphs (Q1076033) (← links)
- Note to a problem of T. Gallai and G. A. Dirac (Q1076035) (← links)
- Multipartite graph-sparse graph Ramsey numbers (Q1076043) (← links)
- The solution of Graham's greatest common divisor problem (Q1076053) (← links)
- On Lovász' lattice reduction and the nearest lattice point problem (Q1076512) (← links)
- Balancing vectors in the max norm (Q1076635) (← links)
- On the number of paths and cycles for almost all graphs and digraphs (Q1076688) (← links)
- On the existence of two non-neighboring subgraphs in a graph (Q1078191) (← links)
- Regular subgraphs of dense graphs (Q1078194) (← links)
- About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets (Q1078212) (← links)
- A size-width inequality for distributive lattices (Q1078217) (← links)
- Counting points in hypercubes and convolution measure algebras (Q1078567) (← links)
- A Desarguesian theorem for algebraic combinatorial geometries (Q1078570) (← links)
- A strongly polynomial minimum cost circulation algorithm (Q1079110) (← links)
- Legal coloring of graphs (Q1079578) (← links)
- How many atoms can be defined by boxes ? (Q1079815) (← links)
- A parity digraph has a kernel (Q1080430) (← links)
- The asymptotic number of acyclic digraphs. I (Q1080860) (← links)
- Families of cuts with the MFMC-property (Q1082240) (← links)
- Inclusion-exclusion inequalities (Q1083452) (← links)
- On the sharpness of a theorem of B. Segre (Q1084336) (← links)
- Maximum set of edges no two covered by a clique (Q1084407) (← links)
- Contractible edges in triangle-free graphs (Q1085181) (← links)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (Q1086246) (← links)
- Maximal tight sets and the Edmonds-Gallai decomposition for matchings (Q1086254) (← links)
- A non-analytic proof of the Newman-Znám result for disjoint covering systems (Q1086272) (← links)
- A characterization of the minimalbasis of the torus (Q1087550) (← links)
- An augmenting path algorithm for linear matroid parity (Q1087880) (← links)
- Proof of a conjecture of Kahn for non-binary matroids (Q1088671) (← links)
- On a pursuit game on Cayley graphs (Q1090336) (← links)
- A shellable poset that is not lexicographically shellable (Q1091408) (← links)
- Maximum of k-th maximal spanning trees of a weighted graph (Q1092057) (← links)
- Expanding graphs contain all small trees (Q1092058) (← links)
- Adjoints of oriented matroids (Q1092910) (← links)
- On digraphs with no two disjoint directed cycles (Q1092919) (← links)
- An inequality conjectured by Hajela and Seymour arising in combinatorial geometry (Q1093026) (← links)
- A canonical restricted version of van der Waerden's theorem (Q1093636) (← links)
- Coloring planar perfect graphs by decomposition (Q1093649) (← links)
- The smallest n-uniform hypergraph with positive discrepancy (Q1093653) (← links)
