scientific article; zbMATH DE number 3582190
From MaRDI portal
Publication:4152571
zbMath0374.05041MaRDI QIDQ4152571
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Graph theory (05C99) Combinatorial aspects of packing and covering (05B40)
Related Items
Clique partitions of the cocktail party graph ⋮ Regarding two conjectures on clique and biclique partitions ⋮ Spectral radius and clique partitions of graphs ⋮ Property testing of the Boolean and binary rank ⋮ Circulant almost cross intersecting families ⋮ Clique covering and clique partition in generalizations of line graphs ⋮ On the complexity of cover-incomparability graphs of posets ⋮ An overview of graph covering and partitioning ⋮ Upper bounds on the Boolean rank of Kronecker products ⋮ Uniform-scale assessment of role minimization in bipartite networks and its application to access control ⋮ Known Algorithms for Edge Clique Cover are Probably Optimal ⋮ Unnamed Item ⋮ A clique covering MIP model for the irregular strip packing problem ⋮ Minimum-rank and maximum-nullity of graphs and their linear preservers ⋮ On the intractability landscape of digraph intersection representations ⋮ Good characterizations and linear time recognition for 2-probe block graphs ⋮ On dimensional properties of graphs ⋮ Clique partitions and clique coverings ⋮ Clique Cover and Graph Separation ⋮ Sequential Relational Decomposition ⋮ Rank one preservers between spaces of Boolean matrices ⋮ The Boolean rank of the uniform intersection matrix and a family of its submatrices ⋮ The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions ⋮ On a symmetric representation of Hermitian matrices and its applications to graph theory ⋮ Elements of Fuzzy Logic in Solving Clustering Problems ⋮ A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints ⋮ Modeling combinatorial disjunctive constraints via junction trees ⋮ Edge-clique covers of the tensor product ⋮ Mod/Resc parsimony inference: theory and application ⋮ Biclique completion problems for multicast network design ⋮ On minimally non-firm binary matrices ⋮ Inertia and biclique decompositions of joins of graphs ⋮ Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions ⋮ Edge clique covering sum of graphs ⋮ Generalized k-tuple colorings of cycles and other graphs ⋮ The Complexity of Complexity ⋮ String execution time for finite languages: max is easy, min is hard ⋮ Factorizing Boolean matrices using formal concepts and iterative usage of essential entries ⋮ On a clique covering problem of Orlin ⋮ Edge cover by connected bipartite subgraphs ⋮ Achieving distributed control through model checking ⋮ Asymptotic values of clique partition numbers ⋮ Hardness results for covering arrays avoiding forbidden edges and error-locating arrays ⋮ Parameterized low-rank binary matrix approximation ⋮ On clique partitions of split graphs ⋮ On the kernel size of clique cover reductions for random intersection graphs ⋮ ON AN INVARIANT FOR THE PROBLEM OF UNDERDETERMINED DATA DECOMPOSING ⋮ Coloring temporal graphs ⋮ Jump Number of Two-Directional Orthogonal Ray Graphs ⋮ Edge clique partition in \((k,\ell)\)-graphs ⋮ Clique partitions of complements of forests and bounded degree graphs ⋮ On the partition and coloring of a graph by cliques ⋮ On the geometric interpretation of the nonnegative rank ⋮ Block-graph width ⋮ Clique coverings and partitions of line graphs ⋮ Bounds for the completely positive rank of a symmetric matrix over a tropical semiring ⋮ Clustering with partial information ⋮ Fast constructive and improvement heuristics for edge clique covering ⋮ On the complexity of directed intersection representation of DAGs ⋮ Clustering with Partial Information ⋮ Unnamed Item ⋮ A set coverage problem ⋮ Unnamed Item ⋮ Boolean rank of Kronecker products ⋮ On the complete width and edge clique cover problems ⋮ On the triangle clique cover and \(K_t\) clique cover problems ⋮ Independent sets and hitting sets of bicolored rectangular families ⋮ Bijective linear maps on semimodules spanned by Boolean matrices of fixed rank ⋮ Large-scale clique cover of real-world networks ⋮ A generalization of the Bollobás set pairs inequality ⋮ Edge importance in a network via line graphs and the matrix exponential ⋮ Редукция графа при поиске реберного покрытия минимальным числом клик ⋮ Eigenvalues and clique partitions of graphs ⋮ Factoring a band matrix over a semiring ⋮ Covering Graphs with Few Complete Bipartite Subgraphs ⋮ On biclique decompositions of complete \(t\)-partite graphs ⋮ The Minimum Weight In-Tree Cover Problem ⋮ Hardness and structural results for half-squares of restricted tree convex bipartite graphs ⋮ Covering graphs with few complete bipartite subgraphs ⋮ On the number of distinct minimal clique partitions and clique covers of a line graph ⋮ Decompositions of complete multigraphs related to Hadamard matrices ⋮ Phylogeny numbers ⋮ On the boolean minimal realization problem in the max-plus algebra ⋮ Applications of edge coverings by cliques ⋮ On some FPT problems without polynomial Turing compressions ⋮ Covering arrays avoiding forbidden edges ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Efficient approximation for restricted biclique cover problems ⋮ Boolean-rank-preserving operators and Boolean-rank-1 spaces ⋮ A characterization of competition graphs of arbitrary digraphs ⋮ On the Computation of the Competition Number of a Graph ⋮ A linear programming formulation for the maximum complete multipartite subgraph problem ⋮ Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices ⋮ Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted ⋮ More on deterministic and nondeterministic finite cover automata
