The following pages link to Recognition of Circle Graphs (Q4285912):
Displaying 37 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)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- Minimum weight feedback vertex sets in circle graphs (Q963384) (← links)
- Diamond-free circle graphs are Helly circle (Q965965) (← links)
- Interlace polynomials: enumeration, unimodality and connections to codes (Q968188) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- APX-hardness of domination problems in circle graphs (Q1045943) (← links)
- Simultaneous dominance representation of multiple posets (Q1362580) (← links)
- A proof of a circle graph characterization (Q1367045) (← links)
- Container ship stowage problem complexity and connection to the coloring of circle graphs (Q1570840) (← links)
- Euler circuits and DNA sequencing by hybridization (Q1585320) (← links)
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← 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)
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model (Q2418739) (← links)
- Counting hexagonal patches and independent sets in circle graphs (Q2429365) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- NP-completeness results for edge modification problems (Q2500532) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- Computing NodeTrix Representations of Clustered Graphs (Q2961508) (← links)
- Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search (Q3060200) (← 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)
