The following pages link to Hypergraphs with no special cycles (Q594899):
Displaying 16 items.
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Totally balanced dissimilarities (Q779024) (← links)
- Characterizations of strongly chordal graphs (Q1051004) (← links)
- The network flows approach for matrices with given row and column sums (Q1052337) (← links)
- Hypergraphs without a large star (Q1061141) (← links)
- A characterization of totally balanced hypergraphs (Q1066918) (← links)
- Strong unimodularity for matrices and hypergraphs (Q1104339) (← links)
- On hypergraph acyclicity and graph chordality (Q1114449) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- Stability and venture structures in multilateral matching (Q2231380) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- Binary set systems and totally balanced hypergraphs (Q2661224) (← links)
- The Multilinear Polytope for Acyclic Hypergraphs (Q4637506) (← links)
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences (Q6561231) (← links)
- Transit functions and pyramid-like binary clustering systems (Q6611037) (← links)
