Pages that link to "Item:Q3993087"
From MaRDI portal
The following pages link to Hypergraphs. Combinatorics of finite sets. Transl. from the French (Q3993087):
Displaying 50 items.
- Transferability of collective transportation line networks from a topological and passenger demand perspective (Q258446) (← links)
- Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs (Q260020) (← links)
- Fast, flexible MUS enumeration (Q272009) (← links)
- Recursive Betti numbers for Cohen-Macaulay \(d\)-partite clutters arising from posets (Q272993) (← links)
- Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees (Q274673) (← links)
- Kernels by monochromatic paths and color-perfect digraphs (Q274681) (← links)
- Graphs, hypergraphs, and properads (Q276737) (← links)
- Bounds on the number of edges in hypertrees (Q279202) (← links)
- Richardson's theorem in \(H\)-coloured digraphs (Q292262) (← links)
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- Generating all maximal models of a Boolean expression (Q294760) (← links)
- Maximum number of colors in hypertrees of bounded degree (Q302137) (← links)
- Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees (Q311513) (← links)
- Completion and decomposition of hypergraphs into dominating sets of graphs (Q322230) (← links)
- Bounds on the game transversal number in hypergraphs (Q326647) (← links)
- On the principal eigenvectors of uniform hypergraphs (Q331188) (← links)
- Associativity and non-associativity of some hypergraph products (Q340610) (← links)
- \(H\)-kernels in infinite digraphs (Q354449) (← links)
- Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs (Q389497) (← links)
- On the Varshamov-Tenengolts construction on binary strings (Q393366) (← links)
- Oriented hypergraphs: introduction and balance (Q396889) (← links)
- On regular hypergraphs of high girth (Q405152) (← links)
- Maximum number of colors: C-coloring and related problems (Q408951) (← links)
- Autonomous sets for the hypergraph of all canonical covers (Q429444) (← links)
- 2-regular equicolourings for \(\mathbf P_4\)-designs (Q442308) (← links)
- Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover (Q456689) (← links)
- Mathematical morphology on hypergraphs using vertex-hyperedge correspondence (Q470535) (← links)
- An abstraction of Whitney's broken circuit theorem (Q470960) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Vertex and edge dimension of hypergraphs (Q489357) (← links)
- Monochromatic connecting colorings in strongly connected oriented graphs (Q507473) (← links)
- Hypergraphs and hypermatrices with symmetric spectrum (Q512036) (← links)
- Semigroup approach to diffusion and transport problems on networks (Q512186) (← links)
- A Richardson's theorem version for \(\Pi\)-kernels (Q512571) (← links)
- Strongly connected multivariate digraphs (Q521369) (← links)
- Hypergraph polytopes (Q554398) (← links)
- On the Hamming distance in combinatorial optimization problems on hypergraph matchings (Q601985) (← links)
- The existence spectrum of Meta\((K^{(3)}_{4} > K^{(3)}_{4} - e)\) (Q625933) (← links)
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem (Q628662) (← links)
- Hypergraphs of multiparty secrets (Q656828) (← links)
- On the covering number \(c_\lambda(3,W_4^{(3)}, v)\) (Q692701) (← links)
- Exact localisations of feedback sets (Q722200) (← links)
- Covering triangles in edge-weighted graphs (Q726109) (← links)
- Masking patterns in sequences: A new class of motif discovery with don't cares (Q732023) (← links)
- Phylogenetic diversity and the maximum coverage problem (Q735104) (← links)
- Distance spectral radius of uniform hypergraphs (Q739129) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- On an extension of Knuth's rotation correspondence to reduced planar trees (Q744409) (← links)
- Vertex-monochromatic connectivity of strong digraphs (Q776297) (← links)
- The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs (Q776316) (← links)
