The following pages link to Recognition of Circle Graphs (Q4285912):
Displaying 13 items.
- Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733) (← links)
- Notes on a theorem of Naji (Q329556) (← links)
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- Practical and efficient circle graph recognition (Q472484) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- The interlace polynomial of a graph (Q705880) (← links)
- Splitting cubic circle graphs (Q726651) (← links)
- Isotropic matroids. II: Circle graphs (Q727169) (← links)
- Computing NodeTrix Representations of Clustered Graphs (Q2961508) (← links)
- (Q5874479) (← links)
- From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals (Q6064591) (← links)
- Describing realizable Gauss diagrams using the concepts of parity or bipartite graphs (Q6064923) (← links)
