The following pages link to (Q5668821):
Displayed 50 items.
- Cayley, Marty and Schreier hypergraphs (Q1341254) (← links)
- Model-based inference in CHARME. (Q1342427) (← links)
- A hypergraph model for constraint logic programming and applications to bus drivers' scheduling (Q1353919) (← links)
- Probability propagation (Q1356197) (← links)
- The strongly perfectness of normal product of \(t\)-perfect graphs (Q1376056) (← links)
- Recognizing intersection graphs of linear uniform hypergraphs (Q1376077) (← links)
- Paths with minimum range and ratio of arc lengths (Q1377658) (← links)
- On \(k\)-hypertournament matrices (Q1414139) (← links)
- Note on the outdegree of a node in random recursive trees (Q1429335) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- Even cycles in hypergraphs (Q1775899) (← links)
- Remarks on hyperenergetic circulant graphs (Q1779274) (← links)
- Interval stability and interval covering property in finite posets (Q1803666) (← links)
- Some extensions of a hypergraph (Q1812618) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- Isolating the most recent entry in a random recursive tree by random cuts (Q1885072) (← links)
- Potts models and random-cluster processes with many-body interactions (Q1897057) (← links)
- Close-to-optimal and near-optimal broadcasting in random graphs (Q1902897) (← links)
- Any complete preference structure without circuit admits an interval representation (Q1908002) (← links)
- Compatible connectedness in graphs and topological spaces (Q1917671) (← links)
- Dynamic maintenance of the transitive closure in disjunctive graphs (Q1924722) (← links)
- On the strong chromatic index of cyclic multigraphs (Q1962032) (← links)
- Multicolor routing in the undirected hypercube (Q1971219) (← links)
- The Gauss-Manin connection of the integral of the deformed difference product (Q1974794) (← links)
- Matroidal bijections between graphs (Q2276983) (← 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 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)
- (Q2777523) (← links)
- Covering, Packing and Generalized Perfection (Q3220635) (← 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)
- (Q3344218) (← links)
- On Invariants of Graphs with Applications to Knot Theory (Q3348008) (← links)
- (Q3410606) (← links)
- On-line models and algorithms for max independent set (Q3411297) (← links)
- On the problem of domino recognition (Q3439447) (← links)
- Maximum Rank of Powers of a Matrix of a Given Pattern (Q3470496) (← links)
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs (Q3503841) (← links)
- An Improved Algorithm for Finding Cycles Through Elements (Q3503860) (← links)
- Weak edge-degree domination in hypergraphs (Q3599858) (← links)
- Subdivision Drawings of Hypergraphs (Q3611876) (← links)
- (Q3669457) (← links)