The following pages link to (Q3218167):
Displaying 9 items.
- Gallai-type results for multiple boxes and forests (Q583206) (← links)
- Exchangeable interval hypergraphs and limits of ordered discrete structures (Q784163) (← links)
- A superclass of edge-path-tree graphs with few cliques (Q1038105) (← links)
- A characterization of totally balanced hypergraphs (Q1066918) (← links)
- On hypergraph acyclicity and graph chordality (Q1114449) (← links)
- Graphs with largest number of minimum cuts (Q1917282) (← links)
- Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
- On the Galois lattice of bipartite distance hereditary graphs (Q2352777) (← links)
- Binary set systems and totally balanced hypergraphs (Q2661224) (← links)