Pages that link to "Item:Q5512009"
From MaRDI portal
The following pages link to The Representation of a Graph by Set Intersections (Q5512009):
Displaying 50 items.
- Minimum \(H\)-decompositions of graphs: edge-critical case (Q414645) (← links)
- Boolean rank of upset tournament matrices (Q417452) (← links)
- Three notions of tropical rank for symmetric matrices (Q452818) (← links)
- Dominating sequences in grid-like and toroidal graphs (Q504964) (← links)
- Unique intersectability of diamond-free graphs (Q534340) (← links)
- Optimal guard sets and the Helly property (Q607361) (← links)
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays (Q650881) (← links)
- A note on the intersection property for flat boxes and boxicity in \(\mathbb R^d\) (Q722353) (← links)
- An improved error term for minimum \(H\)-decompositions of graphs (Q740649) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- Upper bounds on the edge clique cover number of a graph (Q799696) (← links)
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices (Q802577) (← links)
- Decomposing oriented graphs into transitive tournaments (Q817766) (← links)
- Spectral radius and clique partitions of graphs (Q820994) (← links)
- Networks beyond pairwise interactions: structure and dynamics (Q823239) (← links)
- Tree representations of graphs (Q875046) (← links)
- Edge-clique covers of the tensor product (Q897963) (← links)
- Forbidden induced subgraphs for bounded \(p\)-intersection number (Q898105) (← links)
- Clique partitions of distance multigraphs (Q932596) (← links)
- Friendship decompositions of graphs (Q932609) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- An Erdős-Gallai conjecture (Q1068106) (← links)
- Maximum set of edges no two covered by a clique (Q1084407) (← links)
- Clique covering of graphs (Q1100482) (← links)
- Covering graphs by the minimum number of equivalence relations (Q1103644) (← links)
- Clique partitions and clique coverings (Q1124604) (← links)
- Graphs which, with their complements, have certain clique covering numbers (Q1158174) (← links)
- Complexity of representation of graphs by set systems (Q1158768) (← links)
- On a clique covering problem of Orlin (Q1164073) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- Triangle-free partial graphs and edge covering theorems (Q1171575) (← links)
- On the number of edge disjoint cliques in graphs of given size (Q1180425) (← links)
- A note on induced cycles in Kneser graphs (Q1180426) (← links)
- The intersection numbers of a complex (Q1228618) (← links)
- On antichain intersection numbers, total clique covers and regular graphs (Q1322237) (← links)
- Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs (Q1340140) (← links)
- Greedy maximum-clique decompositions (Q1340141) (← links)
- The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique (Q1343169) (← links)
- Intersection properties of line graphs (Q1356691) (← links)
- Dot product representations of graphs (Q1381853) (← links)
- On the double competition number (Q1383383) (← links)
- Intersection representation of complete unbalanced bipartite graphs (Q1386430) (← links)
- Covers of Eulerian graphs (Q1417961) (← links)
- Turán function and \(H\)-decomposition problem for gem graphs (Q1649911) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- Constructing an indeterminate string from its associated graph (Q1698711) (← links)
- Edge clique covering sum of graphs (Q1701317) (← links)
- \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges (Q1733864) (← links)
- An improved upper bound and algorithm for clique covers (Q1748206) (← links)
