The following pages link to (Q5615282):
Displaying 50 items.
- Almost all digraphs have a kernel (Q915737) (← links)
- \(k\)-linked and \(k\)-cyclic digraphs (Q917574) (← links)
- Cycles and paths of many lengths in bipartite digraphs (Q923098) (← links)
- RUBIS: a bipolar-valued outranking method for the choice problem (Q941003) (← links)
- Facet defining inequalities among graph invariants: The system graphedron (Q944740) (← links)
- Binary clustering (Q947063) (← links)
- Stability of two player game structures (Q948685) (← links)
- Finding induced trees (Q967418) (← links)
- Frustration and overblocking on graphs (Q967970) (← links)
- Series-parallel chromatic hypergraphs (Q968129) (← links)
- Complexity of two coloring problems in cubic planar bipartite mixed graphs (Q968180) (← links)
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs (Q975464) (← links)
- Uniqueness of the perfect fusion grid on \(\mathbb{Z}^d\) (Q993537) (← links)
- A survey of known results and research areas for \(n\)-queens (Q998490) (← links)
- Preemptive scheduling and antichain polyhedra (Q1003473) (← links)
- Weighted fusion graphs: Merging properties and watersheds (Q1005244) (← links)
- Fusion graphs: merging properties and watersheds (Q1009213) (← links)
- The complexity of clique graph recognition (Q1019185) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- Blockers and transversals (Q1043948) (← links)
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid (Q1045154) (← links)
- On the notion of cycles in hypergraphs (Q1045194) (← links)
- A note on the girth of digraphs (Q1051651) (← links)
- Arbres minimaux d'un graphe preordonne (Q1053701) (← links)
- Nowhere-zero integral flows on a bidirected graph (Q1053716) (← links)
- The 1-factorization of some line-graphs (Q1056762) (← links)
- Sur la séparation dans les graphes de Cayley abéliens (Q1059639) (← links)
- Estimates of general Mayer graphs. I. Construction of upper bounds for a given graph by means of sets of subgraphs. III. Upper bounds obtained by means of spanning n-trees. IV. On the computation of Gaussian integrals by star-mesh transformation (Q1063010) (← links)
- Component structure in the evolution of random hypergraphs (Q1063043) (← links)
- A three-dimensional quadratic nonconforming element (Q1065497) (← links)
- Semigroups characterizing hypergraphs (Q1066164) (← links)
- On the pseudo-steady-state approximation and Tikhonov theorem for general enzyme systems (Q1068751) (← links)
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions (Q1069444) (← links)
- On shortest cocycle covers of graphs (Q1070245) (← links)
- Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés (Q1073816) (← links)
- On the Shannon capacity of a directed graph (Q1074597) (← links)
- On Tutte polynomials and cycles of plane graphs (Q1077427) (← links)
- Bipartable graphs (Q1080439) (← links)
- Quelques utilisations de la STRUCTION. (Some applications of STRUCTION) (Q1080863) (← links)
- A note on superbrittle graphs (Q1081614) (← links)
- The Copeland choice function. An axiomatic characterization (Q1082226) (← links)
- Partitions of digraphs into paths or circuits (Q1084110) (← links)
- On randomized stopping points and perfect graphs (Q1085176) (← links)
- Generating stable permutations (Q1087542) (← links)
- Sur la contraction des graphes orientés en \(K^ *_ 3\). (On the contraction of digraphs onto \(K^ *_ 3)\) (Q1091394) (← links)
- Large induced degenerate subgraphs (Q1092059) (← links)
- Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number (Q1092065) (← links)
- On a relationship between Hadwiger and stability numbers (Q1092928) (← links)
- On the null-homotopy of graphs (Q1096644) (← links)
