The Representation of a Graph by Set Intersections
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On antichain intersection numbers, total clique covers and regular graphs
- Sphericity, cubicity, and edge clique covers of graphs
- Clique coverings of graphs V: maximal-clique partitions
- The mincut graph of a graph
- Minimal common factor graphs containing all graphs of order k
- Avoiding exponential explosion in Petri net models of control flows
- Regular bipartite decompositions of pseudorandom graphs
- Antimagic labelings on graphs with ascending subgraph decomposition
- On the triangle clique cover and \(K_t\) clique cover problems
- A note on induced cycles in Kneser graphs
- Minimum \(H\)-decompositions of graphs
- Triangle-free partial graphs and edge covering theorems
- On the intersection number of a graph
- On clique covers and independence numbers of graphs
- Cycle packing
- scientific article; zbMATH DE number 5707918 (Why is no real title available?)
- Overlap number of graphs
- Covers of Eulerian graphs
- Interval digraphs: An analogue of interval graphs
- Graphs which, with their complements, have certain clique covering numbers
- Greedy maximum-clique decompositions
- Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs
- On Blocky Ranks Of Matrices
- Problems and invariants connected with bicliques and multicliques of graphs
- Privacy-preserving data splitting: a combinatorial approach
- Path decompositions of Eulerian graphs
- Covering a graph by topological complete subgraphs
- Edge clique covering sum of graphs
- Dot product representations of graphs
- Towards the Erdős-Gallai cycle decomposition conjecture
- scientific article; zbMATH DE number 7225862 (Why is no real title available?)
- Turán and Ramsey properties of subcube intersection graphs
- Dominating sequences in grid-like and toroidal graphs
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
- The minimum number of triangles covering the edges of a graph
- Efficient local representations of graphs
- On clique coverings of complete multipartite graphs
- On the relations among edge magic total, edge antimagic total, and ASD-antimagic graphs
- Constructing an indeterminate string from its associated graph
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
- Upper bounds on the edge clique cover number of a graph
- Path and cycle decompositions of dense graphs
- General results on tolerance intersection graphs
- Clique partitions of distance multigraphs
- Friendship decompositions of graphs
- Pseudo orthogonal Latin squares
- Set labelling vertices to ensure adjacency coincides with disjointness
- Magic labeling on graphs with ascending subgraph decomposition
- Forbidden subgraphs of co-prime graphs of finite groups
- Greedy clique decompositions and the Turán numbers
- Covering arrays avoiding forbidden edges
- On the number of edge disjoint cliques in graphs of given size
- A generalization of the Bollobás set pairs inequality
- Applications of edge coverings by cliques
- On a problem of G. O. H. Katona and T. Tarján
- On the Decomposition of Graphs
- Cycle and cocycle coverings of graphs
- Complexity of representation of graphs by set systems
- On complete subgraphs of different orders
- Decomposing oriented graphs into transitive tournaments
- Decomposing random graphs into few cycles and edges
- Maximum set of edges no two covered by a clique
- The intersection numbers of a complex
- Decompositions of triangle-free 5-regular graphs into paths of length five
- Graphs of small dimensions
- Clique covering of graphs
- Monochromatic clique decompositions of graphs
- Spectral radius and clique partitions of graphs
- Networks beyond pairwise interactions: structure and dynamics
- scientific article; zbMATH DE number 3166040 (Why is no real title available?)
- Orthogonal partitions and covering of graphs
- An algorithm for the decomposition of graphs into cliques
- On set intersection representations of graphs
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
- scientific article; zbMATH DE number 4137790 (Why is no real title available?)
- An overview of graph covering and partitioning
- Simultaneous intersection representation of pairs of graphs
- Unique intersectability of diamond-free graphs
- On graphs of bounded semilattices
- Exact algorithms for restricted subset feedback vertex set in chordal and split graphs
- Intersection properties of line graphs
- Decomposing uniform hypergraphs into uniform hypertrees and single edges
- Algorithms and bounds for very strong rainbow coloring
- \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges
- Covers in hypergraphs
- Towards a comprehensive theory of conflict-tolerance graphs
- The Drew-Johnson-Loewy conjecture for matrices over max-min semirings
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Tree representations of graphs
- Decomposition of graphs into (k,r)-fans and single edges
- Sharp bounds for decomposing graphs into edges and triangles
- Minimum \(H\)-decompositions of graphs: edge-critical case
- Boolean rank of upset tournament matrices
- A CARTESIAN REPRESENTATION OF A GRAPH
- Three notions of tropical rank for symmetric matrices
- Completely positive matrices over Boolean algebras and their CP-rank
- Separating path systems of almost linear size
- Clique coverings of the edges of a random graph
- On graphs with equal coprime index and clique number
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
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)
