Clique Covering of Graphs IV. Algorithms

Abstract

Previous article Next article Clique Covering of Graphs IV. AlgorithmsNorman J. PullmanNorman J. Pullmanhttps://doi.org/10.1137/0213005PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstractWe present linear time algorithms for computing the minimum number of complete subgraphs needed to cover or partition the edges of any simple graph G with maximal degree less than 5.[1] Alfred V. Aho, , John E. Hopcroft and , Jeffrey D. Ullman, The design and analysis of computer algorithms, Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, 1975x+470 54:1706 0326.68005 Google Scholar[2] J. A. Bondy and , U. S. R. Murty, Graph theory with applications, Macmillan, London, 1977 Google Scholar[3] A. Donald, Masters Thesis, Edge and arc partitions of arbitrary graphs and digraphs, M.Sc. thesis, Queen's University, Kingston, Ontario, Canada, 1979 Google Scholar[4] Paul Erdös, , A. W. Goodman and , Lajos Pósa, The representation of a graph by set intersections, Canad. J. Math., 18 (1966), 106–112 32:4034 0137.43202 CrossrefISIGoogle Scholar[5] Frank Harary, Graph theory, Addison-Wesley Publishing Co., Reading, Mass.-Menlo Park, Calif.-London, 1969ix+274 41:1566 0182.57702 CrossrefGoogle Scholar[6] L. Lovász, P. Erdos and , G. Katona, On covering of graphsTheory of Graphs (Proc. Colloq., Tihany, 1966), Academic Press, New York, 1968, 231–236 38:2044 0157.31202 Google Scholar[7] James Orlin, Contentment in graph theory: covering graphs with cliques, Nederl. Akad. Wetensch. Proc. Ser. A, 39 (1977), 406–424 58:366 0374.05041 CrossrefGoogle Scholar[8] Norman J. Pullman and , Dom de Caen, Clique coverings of graphs. I. Clique partitions of regular graphs, Utilitas Math., 19 (1981), 177–205 82j:05089a 0469.05050 Google Scholar[9] Norman J. Pullman and , A. W. Donald, Clique coverings of graphs. II. Complements of cliques, Utilitas Math., 19 (1981), 207–213 82j:05089b 0469.05051 Google Scholar[10] Norman J. Pullman and , Dom de Caen, Clique coverings of graphs. III. Clique coverings of regular graphs, Congr. Numer., 29 (1980), 795–808 82j:05089c 0484.05048 Google Scholar[11] H. Ryser, Intersection properties of finite sets, J. Combinatorial Theory Ser. A, 14 (1973), 79–92 10.1016/0097-3165(73)90065-4 46:7062 0248.05006 CrossrefGoogle Scholar[12] H. Ryser, Intersection properties of finite sets, Colloquio Internazionale sulle Teorie Combinatorie, Roma 3–5 settembre 1973, Tomo II, Accademia Nazionale dei Lincei, Rome, 1976, 328–334 Google ScholarKeywordscliquecoveringpartitionalgorithmcomplete subgraph Previous article Next article FiguresRelatedReferencesCited ByDetails An overview of graph covering and partitioningDiscrete Mathematics, Vol. 345, No. 8 | 1 Aug 2022 Cross Ref Edge clique partition in (k,ℓ) -graphsDiscrete Applied Mathematics, Vol. 306 | 1 Jan 2022 Cross Ref A Novel Deployment Method for UAV-mounted Mobile Base Stations2021 17th International Conference on Mobility, Sensing and Networking (MSN) | 1 Dec 2021 Cross Ref Fast constructive and improvement heuristics for edge clique coveringDiscrete Optimization, Vol. 39 | 1 Feb 2021 Cross Ref Supervised Classification Using Graph-based Space Partitioning for Multiclass Problems2020 25th International Conference on Pattern Recognition (ICPR) | 10 Jan 2021 Cross Ref On the complete width and edge clique cover problemsJournal of Combinatorial Optimization, Vol. 36, No. 2 | 30 December 2016 Cross Ref Induced cycles in triangle graphsDiscrete Applied Mathematics, Vol. 209 | 1 Aug 2016 Cross Ref On the Complete Width and Edge Clique Cover ProblemsComputing and Combinatorics | 24 June 2015 Cross Ref Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar GraphsWALCOM: Algorithms and Computation | 1 Jan 2013 Cross Ref Controlling Size When Aligning Multiple Genomic Sequences with DuplicationsAlgorithms in Bioinformatics | 1 Jan 2006 Cross Ref On the Tree-Degree of GraphsGraph-Theoretic Concepts in Computer Science | 2 October 2001 Cross Ref Efficient BIST TPG design and test set compaction via input reductionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 17, No. 8 | 1 Aug 1998 Cross Ref Clique covering and clique partition in generalizations of line graphsDiscrete Applied Mathematics, Vol. 56, No. 1 | 1 Jan 1995 Cross Ref The clique-partitioning problemComputers & Mathematics with Applications, Vol. 22, No. 6 | 1 Jan 1991 Cross Ref On dimensional properties of graphsGraphs and Combinatorics, Vol. 5, No. 1 | 1 Dec 1989 Cross Ref Maximal-clique partitions of interval graphsJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, Vol. 45, No. 2 | 9 April 2009 Cross Ref Graph theory (algorithmic, algebraic, and metric problems)Journal of Soviet Mathematics, Vol. 39, No. 1 | 1 Oct 1987 Cross Ref Parameters of Partial Orders and Graphs: Packing, Covering, and RepresentationGraphs and Order | 1 Jan 1985 Cross Ref Applications of edge coverings by cliquesDiscrete Applied Mathematics, Vol. 10, No. 1 | 1 Jan 1985 Cross Ref Volume 13, Issue 1| 1984SIAM Journal on Computing History Submitted:14 January 1981Published online:02 August 2006 InformationCopyright © 1984 © Society for Industrial and Applied MathematicsKeywordscliquecoveringpartitionalgorithmcomplete subgraphPDF Download Article & Publication DataArticle DOI:10.1137/0213005Article page range:pp. 57-75ISSN (print):0097-5397ISSN (online):1095-7111Publisher:Society for Industrial and Applied Mathematics