The following pages link to (Q4099676):
Displaying 50 items.
- Efficient algorithms for wavelength assignment on trees of rings (Q1028409) (← links)
- Linear CNF formulas and satisfiability (Q1028433) (← links)
- A survey on the complexity of tournament solutions (Q1042317) (← links)
- On the complexity of Slater's problems (Q1043351) (← links)
- Packing and covering k-chain free subsets in Boolean lattices (Q1043999) (← links)
- A class of hypergraphs satisfying an inequality of Lovasz (Q1050363) (← links)
- Adamant digraphs (Q1104933) (← links)
- Bounds of the longest directed cycle length for minimal strong digraphs (Q1106239) (← links)
- Sequentially rejective pairwise testing procedures (Q1108720) (← links)
- About colorings, stability and paths in directed graphs (Q1120589) (← links)
- A new method to extend kernel-perfect graphs to kernel-perfect critical graphs (Q1121904) (← links)
- A generalization of antiwebs to independence systems and their canonical facets (Q1122478) (← links)
- Connected sequential colourings (Q1123198) (← links)
- The complexity of matching with bonds (Q1123620) (← links)
- Gallai graphs and anti-Gallai graphs (Q1126196) (← links)
- ERCW PRAMs and optical communication (Q1128717) (← links)
- Ensembles d'articulation d'un graphe \(\gamma\)-critique (Q1140657) (← links)
- Matrices of zeros and ones with fixed row and column sum vectors (Q1146695) (← links)
- Maximum number of edges in connected graphs with a given domination number (Q1174141) (← links)
- Extending kernel perfect digraphs to kernel perfect critical digraphs (Q1182966) (← links)
- Distances in cocomparability graphs and their powers (Q1183347) (← links)
- The smallest hard-to-color graph (Q1185079) (← links)
- Integer programs for logic constraint satisfaction (Q1193860) (← links)
- Colorings and orientations of graphs (Q1196681) (← links)
- Qualitative independence and Sperner problems for directed graphs (Q1199993) (← links)
- Hamiltonian cycle is polynomial on cocomparability graphs (Q1201106) (← links)
- The complexity of coloring games on perfect graphs (Q1202928) (← links)
- Antitwins in partitionable graphs (Q1210574) (← links)
- Equipartite colorings in graphs and hypergraphs (Q1236124) (← links)
- A Turan type problem for interval graphs (Q1251233) (← links)
- Bounds for the covering number of a graph (Q1252353) (← links)
- A unified treatment of nearly reducible and nearly decomposable matrices (Q1256021) (← links)
- Fuzzy transversals of fuzzy hypergraphs (Q1267502) (← links)
- Random generation of tournaments and asymmetric graphs with given out-degrees (Q1278398) (← links)
- Linear programs for constraint satisfaction problems (Q1278588) (← links)
- Fuzzy colorings of fuzzy hypergraphs (Q1290569) (← links)
- Sequential colorings and perfect graphs (Q1293205) (← links)
- A sequential coloring algorithm for finite sets (Q1297462) (← links)
- Pseudo-chordal mixed hypergraphs (Q1301719) (← links)
- A cell formation algorithm: Hypergraph approximation -- cut tree (Q1303737) (← links)
- Mutual placement of bipartite graphs (Q1309454) (← links)
- Dominating cliques in chordal graphs (Q1322189) (← links)
- Largest size and union of Helly families (Q1322238) (← links)
- On unique independent sets in graphs (Q1331985) (← links)
- Capacities: From information theory to extremal set theory (Q1337171) (← links)
- A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process (Q1341405) (← links)
- An optimal parallel algorithm for maximal matching (Q1341686) (← links)
- Isometric embeddings into cube-hypergraphs (Q1343777) (← links)
- A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (Q1350189) (← links)
- Line hypergraphs (Q1356430) (← links)
