The following pages link to (Q178718):
Displaying 50 items.
- (Q162984) (redirect page) (← links)
- On partition functions for 3-graphs (Q326824) (← links)
- Characterizing partition functions of the vertex model (Q420721) (← links)
- Characterizing partition functions of the edge-coloring model by rank growth (Q490913) (← links)
- The strong Arnold property for 4-connected flat graphs (Q518116) (← links)
- Matroids and linking systems (Q599061) (← links)
- Characterizing partition functions of the spin model by rank growth (Q740478) (← links)
- Disjoint circuits of prescribed homotopies in a graph on a compact surface (Q757395) (← links)
- Decomposition of graphs on surfaces and a homotopic circulation theorem (Q757396) (← links)
- Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization'' (Q761351) (← links)
- (Q787161) (redirect page) (← links)
- Bounds on the number of Eulerian orientations (Q787162) (← links)
- Packing and covering of crossing families of cuts (Q789399) (← links)
- Graphs whose neighborhoods have no special cycles (Q798333) (← links)
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming (Q855871) (← links)
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation (Q868475) (← links)
- Compact orbit spaces in Hilbert spaces and limits of edge-colouring models (Q896083) (← links)
- Connection matrices and Lie algebra weight systems for multiloop chord diagrams (Q902946) (← links)
- The Klein bottle and multicommodity flows (Q920100) (← links)
- Chvátal closures for mixed integer programming problems (Q922950) (← links)
- Dual graph homomorphism functions (Q966064) (← links)
- Graph invariants in the spin model (Q1003854) (← links)
- Semidefinite functions on categories (Q1028868) (← links)
- Short proofs on the matching polyhedron (Q1050377) (← links)
- An integer analogue of Carathéodory's theorem (Q1074117) (← links)
- Relaxations of vertex packing (Q1078206) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- Edge-disjoint homotopic paths in a planar graph with one hole (Q1097900) (← links)
- Matrices with the Edmonds-Johnson property (Q1100483) (← links)
- On fractional multicommodity flows and distance functions (Q1119950) (← links)
- Homotopy and crossings of systems of curves on a surface (Q1120584) (← links)
- Distances and cuts in planar graphs (Q1121897) (← links)
- Routing and timetabling by topological search (Q1126868) (← links)
- A note on David Lubell's article: ''Local matching in the function space of a partial order'' (Q1141157) (← links)
- A counterexample to a conjecture of Edmonds and Giles (Q1145156) (← links)
- On total dual integrality (Q1159081) (← links)
- On the number of edge-colourings of regular bipartite graphs (Q1166536) (← links)
- Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields (Q1167174) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Disjoint homotopic paths and trees in a planar graph (Q1179127) (← links)
- A simpler proof and a generalization of the zero-trees theorem (Q1180556) (← links)
- Short proofs on multicommodity flows and cuts (Q1186123) (← links)
- Circuits in graphs embedded on the torus (Q1199633) (← links)
- On the uniqueness of kernels (Q1210587) (← links)
- Geometric algorithms and combinatorial optimization (Q1210712) (← links)
- Superextensions which are Hilbert cubes (Q1234105) (← links)
- Group divisible designs with block-size four (Q1243557) (← links)
- The blocking number of an affine space (Q1244233) (← links)
- A short proof of Minc's conjecture (Q1251262) (← links)
- Median graphs and Helly hypergraphs (Q1252871) (← links)
