The following pages link to (Q4152571):
Displaying 50 items.
- Mod/Resc parsimony inference: theory and application (Q418168) (← links)
- Achieving distributed control through model checking (Q453529) (← links)
- On the kernel size of clique cover reductions for random intersection graphs (Q491163) (← links)
- Block-graph width (Q534563) (← links)
- Rank one preservers between spaces of Boolean matrices (Q616292) (← links)
- String execution time for finite languages: max is easy, min is hard (Q642653) (← links)
- Edge cover by connected bipartite subgraphs (Q646717) (← links)
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays (Q650881) (← links)
- On the partition and coloring of a graph by cliques (Q687122) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- Boolean-rank-preserving operators and Boolean-rank-1 spaces (Q791676) (← links)
- Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices (Q810058) (← links)
- Spectral radius and clique partitions of graphs (Q820994) (← links)
- Property testing of the Boolean and binary rank (Q825974) (← links)
- On the complexity of cover-incomparability graphs of posets (Q841163) (← links)
- On a symmetric representation of Hermitian matrices and its applications to graph theory (Q896012) (← links)
- Edge-clique covers of the tensor product (Q897963) (← links)
- Clique partitions of complements of forests and bounded degree graphs (Q952663) (← links)
- A set coverage problem (Q990137) (← links)
- Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- A characterization of competition graphs of arbitrary digraphs (Q1055445) (← links)
- Clique partitions of the cocktail party graph (Q1076691) (← links)
- On dimensional properties of graphs (Q1121914) (← links)
- Clique partitions and clique coverings (Q1124604) (← links)
- Generalized k-tuple colorings of cycles and other graphs (Q1154475) (← links)
- On a clique covering problem of Orlin (Q1164073) (← links)
- Asymptotic values of clique partition numbers (Q1167740) (← links)
- On clique partitions of split graphs (Q1182960) (← links)
- Decompositions of complete multigraphs related to Hadamard matrices (Q1268621) (← links)
- Phylogeny numbers (Q1270783) (← links)
- On the boolean minimal realization problem in the max-plus algebra (Q1274876) (← links)
- Clique covering and clique partition in generalizations of line graphs (Q1343162) (← links)
- Inertia and biclique decompositions of joins of graphs (Q1405108) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- Edge clique covering sum of graphs (Q1701317) (← links)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
- On biclique decompositions of complete \(t\)-partite graphs (Q1805302) (← links)
- On the number of distinct minimal clique partitions and clique covers of a line graph (Q1813995) (← links)
- Fast constructive and improvement heuristics for edge clique covering (Q2019428) (← links)
- On the complexity of directed intersection representation of DAGs (Q2019504) (← links)
- Independent sets and hitting sets of bicolored rectangular families (Q2032357) (← links)
- A generalization of the Bollobás set pairs inequality (Q2040005) (← links)
- Eigenvalues and clique partitions of graphs (Q2040995) (← links)
- Factoring a band matrix over a semiring (Q2041261) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted (Q2117779) (← links)
- Regarding two conjectures on clique and biclique partitions (Q2121747) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
