Clique Covering of Graphs IV. Algorithms
From MaRDI portal
Publication:3340897
DOI10.1137/0213005zbMath0548.05050OpenAlexW2025967594MaRDI QIDQ3340897
Publication date: 1984
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0213005
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Related Items (11)
Induced cycles in triangle graphs ⋮ Clique covering and clique partition in generalizations of line graphs ⋮ An overview of graph covering and partitioning ⋮ On dimensional properties of graphs ⋮ Edge clique partition in \((k,\ell)\)-graphs ⋮ Fast constructive and improvement heuristics for edge clique covering ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ On the complete width and edge clique cover problems ⋮ ℱ-WORM colorings of some 2-trees: partition vectors ⋮ Applications of edge coverings by cliques ⋮ The clique-partitioning problem
This page was built for publication: Clique Covering of Graphs IV. Algorithms
