Pages that link to "Item:Q1066918"
From MaRDI portal
The following pages link to A characterization of totally balanced hypergraphs (Q1066918):
Displaying 12 items.
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Totally balanced dissimilarities (Q779024) (← links)
- On hypergraph acyclicity and graph chordality (Q1114449) (← links)
- Construction of a simple elimination scheme for a chordal comparability graph in linear time (Q1283807) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- Subgraph trees in graph theory (Q1406544) (← links)
- Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs (Q2244993) (← 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)
- Totally Balanced Formal Context Representation (Q5255656) (← links)
- Hardness and structural results for half-squares of restricted tree convex bipartite graphs (Q5919674) (← links)
