The following pages link to (Q5668821):
Displayed 50 items.
- Identifying vital nodes in hypernetwork based on local centrality (Q2108524) (← links)
- Neighborhood hypergraph model for topological data analysis (Q2111089) (← links)
- A generalization of Petersen's matching theorem (Q2111920) (← links)
- The characterization of \(p\)-factor-critical graphs (Q2115227) (← links)
- Spanning tree of a multiple graph (Q2136168) (← links)
- Dynamic evolution of shipping network based on hypergraph (Q2139955) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- Granulation of ecological networks under fuzzy soft environment (Q2156487) (← links)
- Bisecting and \(D\)-secting families for set systems (Q2181239) (← links)
- Generating functions of some families of directed uniform hypergraphs (Q2199871) (← links)
- Unimodular hypergraph for DNA sequencing: a polynomial time algorithm (Q2212678) (← links)
- Coherent network partitions: characterizations with cographs and prime graphs (Q2243575) (← links)
- Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs (Q2244993) (← links)
- The subalgebra lattice of a finite algebra (Q2248503) (← links)
- Matroidal bijections between graphs (Q2276983) (← links)
- Ramsey numbers of Berge-hypergraphs and related structures (Q2278117) (← links)
- Partitioning the power set of \([n]\) into \(C_k\)-free parts (Q2323815) (← links)
- Symmetry in domination for hypergraphs with choice (Q2333489) (← links)
- A matrix approach to hypergraph stable set and coloring problems with its application to storing problem (Q2336703) (← links)
- Certain concepts of bipolar fuzzy directed hypergraphs (Q2358244) (← links)
- A degree sum condition for Hamiltonicity in balanced bipartite digraphs (Q2361075) (← links)
- On the vertex packing problem (Q2366214) (← links)
- Score lists in tripartite hypertournaments (Q2385134) (← links)
- Generalised arc consistency for the AllDifferent constraint: an empirical survey (Q2389692) (← links)
- The Wiener index of \(r\)-uniform hypergraphs (Q2399718) (← links)
- Stability for vertex cycle covers (Q2401441) (← links)
- The \(1/N\) expansion of multi-orientable random tensor models (Q2449876) (← links)
- Chromatic polynomials of mixed hypercycles (Q2509543) (← links)
- The analysis of free-sorting data: Beyond pairwise cooccurrences (Q2563536) (← links)
- Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments (Q2573805) (← links)
- On the upper critical dimension of lattice trees and lattice animals (Q2639456) (← links)
- Generalized Catalan numbers from hypergraphs (Q2656907) (← links)
- Applying a hypergraph to determine the structure of some finite modules (Q2700117) (← links)
- (Q2777523) (← links)
- Domination Parameters in Hypertrees (Q2795956) (← links)
- Mapping schemes realizable by obstructed topological polynomials (Q2888650) (← links)
- Hyperpath Centers (Q2955915) (← links)
- A Graph-Theoretical Characterisation of State Separation (Q2971132) (← links)
- Degree sequences of graphs containing a cycle with prescribed length (Q3070135) (← links)
- Covering, Packing and Generalized Perfection (Q3220635) (← links)
- (Q3300703) (← links)
- Nonexistence of Invariant Measures (Q3308290) (← links)
- Preemptive Scheduling, Linear Programming and Network Flows (Q3315254) (← links)
- Fractional covers for forests and matchings (Q3315281) (← links)
- A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds (Q3336583) (← links)
- The reduced sets: A new solution concept for cooperative games and other decision problems (Q3342238) (← links)
- On a generalization of the matroid (Q3344218) (← links)
- On Invariants of Graphs with Applications to Knot Theory (Q3348008) (← links)
- Domination in Digraphs (Q3384119) (← links)
- (Q3410606) (← links)