Pages that link to "Item:Q762498"
From MaRDI portal
The following pages link to Applications of edge coverings by cliques (Q762498):
Displayed 34 items.
- A generalization of Opsut's lower bounds for the competition number of a graph (Q367054) (← links)
- A generalization of Opsut's result on the competition numbers of line graphs (Q479034) (← links)
- Inverting graphs of rectangular matrices (Q797599) (← links)
- A simple lower bound on edge coverings by cliques (Q807634) (← links)
- Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices (Q810058) (← links)
- Graph models for scheduling systems with machine saturation property (Q883067) (← links)
- Edge-clique covers of the tensor product (Q897963) (← links)
- Extensions of graph inversion to support an artificially intelligent modeling environment (Q918394) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- The competition numbers of complete tripartite graphs (Q1003747) (← links)
- The competition-common enemy graph of a digraph (Q1086581) (← links)
- On dimensional properties of graphs (Q1121914) (← links)
- Niche graphs (Q1123204) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- \((i,j)\) competition graphs (Q1179189) (← links)
- Clique covering and clique partition in generalizations of line graphs (Q1343162) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- Constructing an indeterminate string from its associated graph (Q1698711) (← links)
- Fuzzy \(\phi\)-tolerance competition graphs (Q1701852) (← links)
- An improved upper bound and algorithm for clique covers (Q1748206) (← links)
- Tolerance competition graphs (Q1805304) (← links)
- \(p\)-competition graphs (Q1805319) (← links)
- Intersection number and capacities of graphs (Q1896353) (← links)
- Fast constructive and improvement heuristics for edge clique covering (Q2019428) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- On the intractability landscape of digraph intersection representations (Q2169961) (← links)
- On the triangle clique cover and \(K_t\) clique cover problems (Q2279271) (← links)
- On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\) (Q2495511) (← links)
- Sphericity, cubicity, and edge clique covers of graphs (Q2495913) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Cliques and clique covers in fuzzy graphs1 (Q5275192) (← links)
- (Q6068263) (← links)
- On graphs with equal coprime index and clique number (Q6152608) (← links)