Applications of edge coverings by cliques
From MaRDI portal
Publication:762498
DOI10.1016/0166-218X(85)90061-7zbMath0558.05046OpenAlexW2064280346MaRDI QIDQ762498
Publication date: 1985
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(85)90061-7
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (34)
The competition-common enemy graph of a digraph ⋮ Clique covering and clique partition in generalizations of line graphs ⋮ An overview of graph covering and partitioning ⋮ Intersection number and capacities of graphs ⋮ Known Algorithms for Edge Clique Cover are Probably Optimal ⋮ A clique covering MIP model for the irregular strip packing problem ⋮ On the intractability landscape of digraph intersection representations ⋮ A generalization of Opsut's lower bounds for the competition number of a graph ⋮ On dimensional properties of graphs ⋮ Niche graphs ⋮ Clique Cover and Graph Separation ⋮ Graph models for scheduling systems with machine saturation property ⋮ Edge-clique covers of the tensor product ⋮ On graphs with equal coprime index and clique number ⋮ Constructing an indeterminate string from its associated graph ⋮ Fuzzy \(\phi\)-tolerance competition graphs ⋮ Unnamed Item ⋮ Extensions of graph inversion to support an artificially intelligent modeling environment ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ A generalization of Opsut's result on the competition numbers of line graphs ⋮ \((i,j)\) competition graphs ⋮ An improved upper bound and algorithm for clique covers ⋮ Dimension-2 poset competition numbers and dimension-2 poset double competition numbers ⋮ On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\) ⋮ Sphericity, cubicity, and edge clique covers of graphs ⋮ Fast constructive and improvement heuristics for edge clique covering ⋮ On the triangle clique cover and \(K_t\) clique cover problems ⋮ The competition numbers of complete tripartite graphs ⋮ Tolerance competition graphs ⋮ \(p\)-competition graphs ⋮ Inverting graphs of rectangular matrices ⋮ A simple lower bound on edge coverings by cliques ⋮ Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices ⋮ Cliques and clique covers in fuzzy graphs1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inverting graphs of rectangular matrices
- Some uniqueness results for upper bound graphs
- A characterization of competition graphs
- A characterization of graphs of competition number m
- A characterization of competition graphs of arbitrary digraphs
- Consanguinity graphs
- When is one estimate of evolutionary relationships a refinement of another?
- Graphs which, with their complements, have certain clique covering numbers
- Complexity of representation of graphs by set systems
- On a clique covering problem of Orlin
- Asymptotic values of clique partition numbers
- A simple algorithm to detect balance in signed graphs
- Parallel concepts in graph theory
- On clique covers and independence numbers of graphs
- A characterization of clique graphs
- Über iterierte Clique-Graphen
- Characterization of n-path graphs and of graphs having \(n\)-th root
- On the notion of balance of a signed graph
- Rectangular Matrices and Signed Graphs
- OptimalI-Intersection assignments for graphs: A linear programming approach
- I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications
- Clique Covering of Graphs IV. Algorithms
- Determinacy in Linear Systems and Networks
- Inverting Signed Graphs
- Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices
- Clique coverings of graphs V: maximal-clique partitions
- The Complexity of Near-Optimal Graph Coloring
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- On the Computation of the Competition Number of a Graph
- The Representation of a Graph by Set Intersections
- A Property of Infinite Products of Boolean Matrices
- The square root of a graph
- A partial characterization of clique graphs
- Sur deux propriétés des classes d'ensembles
This page was built for publication: Applications of edge coverings by cliques
