Pages that link to "Item:Q2275917"
From MaRDI portal
The following pages link to Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917):
Displaying 5 items.
- Strong cliques and equistability of EPT graphs (Q260014) (← links)
- Simplicial complexes and closure systems induced by indistinguishability relations (Q2408539) (← links)
- Edge contraction and edge removal on iterated clique graphs (Q2446322) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- Indiscernibility structures induced from function sets : Graph and digraph case (Q5031926) (← links)
