Pages that link to "Item:Q1417569"
From MaRDI portal
The following pages link to Chordal embeddings of planar graphs (Q1417569):
Displaying 13 items.
- On self-duality of branchwidth in graphs of bounded genus (Q411870) (← links)
- Tree-width of hypergraphs and surface duality (Q414640) (← links)
- Contracting planar graphs to contractions of triangulations (Q635743) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Tree-width of graphs and surface duality (Q2839216) (← links)
- THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS (Q2875647) (← links)
- Connected Graph Searching in Outerplanar Graphs (Q3439336) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- (Q5009489) (← links)
- (Q5028434) (← links)
- Branchwidth is \((1, g)\)-self-dual (Q6126712) (← links)
- On the biplanarity of blowups (Q6636991) (← links)
