The Representation of a Graph by Set Intersections
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Covering arrays avoiding forbidden edges
- An Erdős-Gallai conjecture
- Maximum set of edges no two covered by a clique
- Clique covering of graphs
- Covering graphs by the minimum number of equivalence relations
- Clique partitions and clique coverings
- 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
- On the combinatorial problems which I would most like to see solved
- Triangle-free partial graphs and edge covering theorems
- On the number of edge disjoint cliques in graphs of given size
- A note on induced cycles in Kneser graphs
- The intersection numbers of a complex
- On antichain intersection numbers, total clique covers and regular graphs
- Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs
- Greedy maximum-clique decompositions
- The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
- Intersection properties of line graphs
- Dot product representations of graphs
- On the double competition number
- Intersection representation of complete unbalanced bipartite graphs
- Covers of Eulerian graphs
- Turán function and H-decomposition problem for gem graphs
- A clique covering MIP model for the irregular strip packing problem
- Constructing an indeterminate string from its associated graph
- Edge clique covering sum of graphs
- \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges
- An improved upper bound and algorithm for clique covers
- Towards a comprehensive theory of conflict-tolerance graphs
- Paired threshold graphs
- Covering a graph by topological complete subgraphs
- Extremal clique coverings of complementary graphs
- Covers in hypergraphs
- On clique covers and independence numbers of graphs
- Subgraph coverings and edge switchings
- Greedy clique decompositions and the Turán numbers
- Intersection number and capacities of graphs
- Graphs of small dimensions
- Pseudo orthogonal Latin squares
- Fast constructive and improvement heuristics for edge clique covering
- On the complexity of directed intersection representation of DAGs
- Decomposing uniform hypergraphs into uniform hypertrees and single edges
- Privacy-preserving data splitting: a combinatorial approach
- A generalization of the Bollobás set pairs inequality
- Eigenvalues and clique partitions of graphs
- The enumeration of spanning tree of weighted graphs
- Regarding two conjectures on clique and biclique partitions
- Unsupervised feature selection for efficient exploration of high dimensional data
- An overview of graph covering and partitioning
- Double-threshold permutation graphs
- Avoiding exponential explosion in Petri net models of control flows
- On the intractability landscape of digraph intersection representations
- On graphs of bounded semilattices
- On the triangle clique cover and \(K_t\) clique cover problems
- Large-scale clique cover of real-world networks
- On clique coverings of complete multipartite graphs
- Completely positive matrices over Boolean algebras and their CP-rank
- Decompositions of triangle-free 5-regular graphs into paths of length five
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
- Clique coverings of the edges of a random graph
- Minimum \(H\)-decompositions of graphs
- Turán number and decomposition number of intersecting odd cycles
- Set labelling vertices to ensure adjacency coincides with disjointness
- A bound on the total size of a cut cover
- Decomposing toroidal graphs into circuits and edges
- Sphericity, cubicity, and edge clique covers of graphs
- The Cwatset of a Graph
- Overlap number of graphs
- Cycle and cocycle coverings of graphs
- Generalized covering designs and clique coverings
- The intersection number of complete r-partite graphs
- The minimum number of triangles covering the edges of a graph
- scientific article; zbMATH DE number 3166040 (Why is no real title available?)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 7225862 (Why is no real title available?)
- Path and cycle decompositions of dense graphs
- Monochromatic clique decompositions of graphs
- scientific article; zbMATH DE number 4137790 (Why is no real title available?)
- The representation of multi-hypergraphs by set intersections
- scientific article; zbMATH DE number 5707918 (Why is no real title available?)
- On set intersection representations of graphs
- A compilation of relations between graph invariants
- What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
- scientific article; zbMATH DE number 4073027 (Why is no real title available?)
- Interval digraphs: An analogue of interval graphs
- Orthogonal partitions and covering of graphs
- On a problem of G. O. H. Katona and T. Tarján
- On the Decomposition of Graphs
- Clique coverings of graphs V: maximal-clique partitions
- Competition graphs and clique dimensions
- General results on tolerance intersection graphs
- On complete subgraphs of different orders
- Minimum \(H\)-decompositions of graphs: edge-critical case
- Extremal problems in graph theory
- Boolean rank of upset tournament matrices
- Clique Partitions of Chordal Graphs
- The greedy clique decomposition of a graph
- Three notions of tropical rank for symmetric matrices
- Decomposition of graphs into (k,r)-fans and single edges
This page was built for publication: The Representation of a Graph by Set Intersections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5512009)
