Pages that link to "Item:Q1158768"

The following pages link to Complexity of representation of graphs by set systems (Q1158768):

Displaying 9 items.

• A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs (Q505460) (← links)
• Unique intersectability of diamond-free graphs (Q534340) (← links)
• Applications of edge coverings by cliques (Q762498) (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
• Clique coverings and claw-free graphs (Q2189831) (← links)
• Local Clique Covering of Claw-Free Graphs (Q3466357) (← links)
• Edge intersection graphs of linear 3-uniform hypergraphs (Q5899371) (← links)
• Edge intersection graphs of linear 3-uniform hypergraphs (Q5902100) (← links)
• \((k-2)\)-linear connected components in hypergraphs of rank \(k\) (Q6599814) (← links)