scientific article; zbMATH DE number 3838071

MaRDI QIDQ3309876zbMATH OpenFDO

Authors Norman J. Pullman

Publication date 1983

zbMATH Keywords

clique covering numberclique partition numbercomplete subgraphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Cited in

(19)

• Minimal clique partitions and pairwise balanced designs
• On clique partitions of split graphs
• A clique covering MIP model for the irregular strip packing problem
• Edge clique covering sum of graphs
• Fast constructive and improvement heuristics for edge clique covering
• Finding the root graph through minimum edge deletion
• Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs
• An overview of graph covering and partitioning
• On the intractability landscape of digraph intersection representations
• Parliament seating assignment problems
• Edge clique partition in \((k,\ell)\)-graphs
• Compressed cliques graphs, clique coverings and positive zero forcing
• Pairwise balanced designs and sigma clique partitions
• Cliques and clique covers in fuzzy graphs
• Graph theory (algorithmic, algebraic, and metric problems)
• The power of many colours
• On the partition and coloring of a graph by cliques
• Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
• Linearly independent vertices and minimum semidefinite rank

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3309876)