The following pages link to (Q4071273):
Displaying 22 items.
- A complete axiomatization of full acyclic join dependencies (Q293431) (← links)
- Parallel multilevel algorithms for hypergraph partitioning (Q436760) (← links)
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← links)
- Cayley graphs and \(G\)-graphs: some applications (Q651882) (← links)
- Asymptotic probabilities of extension properties and random \(l\)-colourable structures (Q764265) (← links)
- A class of threshold and domishold graphs: Equistable and equidominating graphs (Q795059) (← links)
- New sufficient conditions on the degree sequences of uniform hypergraphs (Q831139) (← links)
- The Helly property on subfamilies of limited size (Q834991) (← links)
- Complexity aspects of generalized Helly hypergraphs (Q845662) (← links)
- The Sprague-Grundy function for Wythoff's game (Q914374) (← links)
- The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
- A family of non-reconstructible hypergraphs (Q1066163) (← links)
- Integer programs for logic constraint satisfaction (Q1193860) (← links)
- A combinatorial problem in logic (Q1235721) (← links)
- Line hypergraphs (Q1356430) (← links)
- Homogeneously orderable graphs (Q1392023) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- An integer programming approach for solving a generalized version of the Grundy domination number (Q2032968) (← links)
- Robust similarity between hypergraphs based on valuations and mathematical morphology operators (Q2255814) (← links)
- On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs (Q2435375) (← links)
- Thresholds for the monochromatic clique transversal game (Q2695001) (← links)
- Transit functions and pyramid-like binary clustering systems (Q6611037) (← links)
