The following pages link to (Q4309133):
Displaying 10 items.
- How is a chordal graph like a supersolvable binary matroid? (Q704292) (← links)
- Cage-amalgamation graphs, a common generalization of chordal and median graphs (Q1024305) (← links)
- Clique neighborhoods and nearly chordal graphs (Q1363699) (← links)
- Subgraph trees in graph theory (Q1406544) (← links)
- Completeness for intersection classes (Q1584399) (← links)
- Multigraph representations of hierarchical loglinear models (Q1918460) (← links)
- Computational processes that appear to model human memory (Q2364899) (← links)
- On the correspondence between tree representations of chordal and dually chordal graphs (Q2448885) (← links)
- Maxclique and unit disk characterizations of strongly chordal graphs (Q2509548) (← links)
- How good is the Chord algorithm? (Q2816293) (← links)
