Pages that link to "Item:Q479046"
From MaRDI portal
The following pages link to Characterizing and computing the structure of clique intersections in strongly chordal graphs (Q479046):
Displaying 5 items.
- Finding intersection models: from chordal to Helly circular-arc graphs (Q409451) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs (Q1735675) (← links)
- MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling (Q6119506) (← links)
- Vines and MAT-labeled graphs (Q6656601) (← links)