Applications of edge coverings by cliques
type: Item
instance of: scholarly article
title: Applications of edge coverings by cliques
zbMATH Open document ID: 0558.05046
DOI: 10.1016/0166-218X(85)90061-7
author: Fred Roberts
published in: Discrete Applied Mathematics
publication date: 1985-01-01T00:00:00Z
review text: The author presents a variety of results on edge clique coverings, and emphasizes the many applied problems in which such coverings arise. This paper contains also a new theorem of the author on the maximal score of an intersection assignment.
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3889574
zbMATH Keywords: edge clique coverings
zbMATH Keywords: maximal score
zbMATH Keywords: intersection assignment
reviewed by: B. Andrasfai
MaRDI profile type: Publication
cites work: Q4152575
cites work: Q3941433
cites work: Graphs which, with their complements, have certain clique covering numbers
cites work: On clique covers and independence numbers of graphs
cites work: A characterization of competition graphs
cites work: Q3659817
cites work: Q4101860
cites work: The Representation of a Graph by Set Intersections
cites work: Über iterierte Clique-Graphen
cites work: Characterization of n-path graphs and of graphs having \(n\)-th root
cites work: When is one estimate of evolutionary relationships a refinement of another?
cites work: Consanguinity graphs
cites work: The Complexity of Near-Optimal Graph Coloring
cites work: Q4198056
cites work: Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices
cites work: Rectangular Matrices and Signed Graphs
cites work: Inverting graphs of rectangular matrices
cites work: Inverting Signed Graphs
cites work: On a clique covering problem of Orlin
cites work: A partial characterization of clique graphs
cites work: On the notion of balance of a signed graph
cites work: Parallel concepts in graph theory
cites work: A simple algorithm to detect balance in signed graphs
cites work: Q4142699
cites work: Covering edges by cliques with regard to keyword conflicts and intersection graphs
cites work: Q5539649
cites work: A characterization of graphs of competition number m
cites work: Sur deux propriétés des classes d'ensembles
cites work: Q3317150
cites work: Some uniqueness results for upper bound graphs
cites work: Q3039403
cites work: The square root of a graph
cites work: On the Computation of the Competition Number of a Graph
cites work: Q3924236
cites work: I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications
cites work: OptimalI-Intersection assignments for graphs: A linear programming approach
cites work: Q4152571
cites work: Complexity of representation of graphs by set systems
cites work: Determinacy in Linear Systems and Networks
cites work: A Property of Infinite Products of Boolean Matrices
cites work: Clique Covering of Graphs IV. Algorithms
cites work: Q3942989
cites work: Q3922718
cites work: Q3922720
cites work: Clique coverings of graphs V: maximal-clique partitions
cites work: Q4138414
cites work: Q4171826
cites work: Q5588433
cites work: Q3931185
cites work: A characterization of clique graphs
cites work: A characterization of competition graphs of arbitrary digraphs
cites work: Q4141850
cites work: Q3313890
cites work: Asymptotic values of clique partition numbers
full work available at URL: 0166-218x(85)90061-7
OpenAlex ID: W2064280346
description: scientific article; zbMATH DE number 3889574