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