Pages that link to "Item:Q472484"
From MaRDI portal
The following pages link to Practical and efficient circle graph recognition (Q472484):
Displaying 13 items.
- Notes on a theorem of Naji (Q329556) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Splitting cubic circle graphs (Q726651) (← links)
- Isotropic matroids. II: Circle graphs (Q727169) (← links)
- Diamond-free circle graphs are Helly circle (Q965965) (← links)
- Forbidden induced subgraph characterization of circle graphs within split graphs (Q2091783) (← links)
- 2-nested matrices: towards understanding the structure of circle graphs (Q2152610) (← links)
- A characterization of circle graphs in terms of multimatroid representations (Q2290352) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search (Q3060200) (← links)
- From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals (Q6064591) (← links)
