The following pages link to (Q4200096):
Displaying 22 items.
- On neighborhood-Helly graphs (Q344856) (← links)
- Representation theorems for graphs whose vertex set is partially ordered (Q762181) (← links)
- Graphs whose neighborhoods have no special cycles (Q798333) (← links)
- Circular representation problem on hypergraphs (Q799695) (← links)
- Clique graphs and Helly graphs (Q802632) (← links)
- Complexity aspects of generalized Helly hypergraphs (Q845662) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- A characterization of totally balanced hypergraphs (Q1066918) (← links)
- Convex sets in graphs. II: Minimal path convexity (Q1120125) (← links)
- Hypergraphes de chaînes d'aretes d'un arbre (Q1169485) (← links)
- Approximations for subset interconnection designs (Q1274995) (← links)
- \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
- Homogeneously orderable graphs (Q1392023) (← links)
- From hypertrees to arboreal quasi-ultrametrics (Q1766738) (← links)
- Graphs with largest number of minimum cuts (Q1917282) (← links)
- Colouring exact distance graphs of chordal graphs (Q2305897) (← links)
- Vertices removal for feasibility of clustered spanning trees (Q2663996) (← links)
- (Q3386616) (← links)
- An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph (Q4917098) (← links)
- Gap one bounds for the equitable chromatic number of block graphs (Q6558671) (← links)
- Decomposing the feasibility of clustered spanning tree by paths (Q6558681) (← links)
- Transit functions and pyramid-like binary clustering systems (Q6611037) (← links)
