The following pages link to (Q5668821):
Displaying 50 items.
- Niche hypergraphs (Q339464) (← links)
- Vertex arboricity and vertex degrees (Q343708) (← links)
- Helly numbers of polyominoes (Q367067) (← links)
- Rounds in combinatorial search (Q378259) (← links)
- On the independence numbers of the cubes of odd cycles (Q396806) (← links)
- Resource-sharing systems and hypergraph colorings (Q411210) (← links)
- Parameterized fairness axioms on cycle-free graph games (Q427375) (← links)
- The \textsc{max quasi-independent set} problem (Q434194) (← links)
- Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices (Q436766) (← links)
- Link scheduling in wireless sensor networks: distributed edge-coloring revisited (Q436862) (← links)
- Fool's solitaire on joins and Cartesian products of graphs (Q482200) (← links)
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- A note on an induced subgraph characterization of domination perfect graphs (Q516908) (← links)
- On the Hamiltonicity of triple systems with high minimum degree (Q521911) (← links)
- Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization (Q537589) (← links)
- The extended global cardinality constraint: an empirical survey (Q543616) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- A category-theoretical approach to hypergraphs (Q599833) (← links)
- Long monochromatic Berge cycles in colored 4-uniform hypergraphs (Q604661) (← links)
- Monochromatic matchings in the shadow graph of almost complete hypergraphs (Q659584) (← links)
- Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs (Q659806) (← links)
- Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems (Q679069) (← links)
- Supra-hereditary properties of hypergraphs (Q691620) (← links)
- Accessible single-valued neutrosophic graphs (Q721543) (← links)
- A new decision-making method based on bipolar neutrosophic directed hypergraphs (Q721582) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- Nonuniform recursive trees with vertex attraction depending on their labels (Q782798) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Deadlock-freedom in resource contentions (Q801672) (← links)
- Computing the maximum-entropy extension of given discrete probability distributions (Q804113) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Chain packing in graphs (Q808291) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- On robust maximum flow with polyhedral uncertainty sets (Q839800) (← links)
- Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks (Q841605) (← links)
- A new analysis of quasianalysis (Q877242) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Graph models for scheduling systems with machine saturation property (Q883067) (← links)
- Selective hypergraph colourings (Q906467) (← links)
- Partitioning multi-edge graphs (Q911315) (← links)
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (Q911763) (← links)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
- A new connection between quantum circuits, graphs and the Ising partition function (Q1007123) (← links)
- NP-complete problems simplified on tree schemas (Q1056539) (← links)
- On 1-factorizability of Cayley graphs (Q1068102) (← links)
- List-colourings of graphs (Q1084403) (← links)
- Semi-duality and the cycle double cover conjecture (Q1085163) (← links)
- An upper bound for families of linearly related plane convex sets (Q1097521) (← links)