Pages that link to "Item:Q1103644"

The following pages link to Covering graphs by the minimum number of equivalence relations (Q1103644):

Displaying 25 items.

• Secret-sharing schemes for very dense graphs (Q290386) (← links)
• The equivalence number of a line graph (Q350825) (← links)
• Product dimension of forests and bounded treewidth graphs (Q396879) (← links)
• Erdős-Pyber theorem for hypergraphs and secret sharing (Q497325) (← links)
• Covering line graphs with equivalence relations (Q608272) (← links)
• On the equivalence covering number of splitgraphs (Q673014) (← links)
• Bounded-depth succinct encodings and the structure they imply on graphs (Q722204) (← links)
• A simple lower bound on edge coverings by cliques (Q807634) (← links)
• On covering graphs by complete bipartite subgraphs (Q1025967) (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
• A note on induced cycles in Kneser graphs (Q1180426) (← links)
• Edge-intersection graphs of boundary-generated paths in a grid (Q1693146) (← links)
• Edge clique covering sum of graphs (Q1701317) (← links)
• Biclique cover and local clique cover of graphs (Q1734028) (← links)
• Graphs of small dimensions (Q1912752) (← links)
• On the product dimension of clique factors (Q1987093) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• Avoiding exponential explosion in Petri net models of control flows (Q2165241) (← links)
• New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings (Q2363963) (← links)
• Set labelling vertices to ensure adjacency coincides with disjointness (Q2413366) (← links)
• Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
• Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
• Local Clique Covering of Claw-Free Graphs (Q3466357) (← links)
• On set intersection representations of graphs (Q3633007) (← links)
• (Q5020600) (← links)