scientific article; zbMATH DE number 3487492
From MaRDI portal
Publication:4071273
Cited in
(22)- A family of non-reconstructible hypergraphs
- Integer programs for logic constraint satisfaction
- A combinatorial problem in logic
- Line hypergraphs
- Homogeneously orderable graphs
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- An integer programming approach for solving a generalized version of the Grundy domination number
- Robust similarity between hypergraphs based on valuations and mathematical morphology operators
- On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs
- Thresholds for the monochromatic clique transversal game
- A complete axiomatization of full acyclic join dependencies
- Parallel multilevel algorithms for hypergraph partitioning
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
- Cayley graphs and G-graphs: some applications
- Transit functions and pyramid-like binary clustering systems
- Asymptotic probabilities of extension properties and random l-colourable structures
- A class of threshold and domishold graphs: Equistable and equidominating graphs
- New sufficient conditions on the degree sequences of uniform hypergraphs
- The Helly property on subfamilies of limited size
- Complexity aspects of generalized Helly hypergraphs
- The Sprague-Grundy function for Wythoff's game
- The Helly property and satisfiability of Boolean formulas defined on set families
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4071273)
