The following pages link to A characterization of circle graphs (Q801089):
Displaying 23 items.
- Characterizing graphic matroids by a system of linear equations (Q461731) (← links)
- On the linear algebra of local complementation (Q665929) (← links)
- The interlace polynomial of a graph (Q705880) (← links)
- Isotropic matroids. II: Circle graphs (Q727169) (← links)
- Topological realizations of ortho-projection graphs (Q842981) (← links)
- Independent sets and chromatic numbers of circle graphs (Q906759) (← links)
- Diamond-free circle graphs are Helly circle (Q965965) (← links)
- Reconnaissance des graphes de cordes (Q1059643) (← links)
- Reducing prime graphs and recognizing circle graphs (Q1116953) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Bipartite graphs that are not circle graphs (Q1296144) (← links)
- A proof of a circle graph characterization (Q1367045) (← links)
- Euler circuits and DNA sequencing by hybridization (Q1585320) (← links)
- A characterization of circle graphs in terms of multimatroid representations (Q2290352) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- Circle graph obstructions under pivoting (Q3633003) (← links)
- Improved bounds for colouring circle graphs (Q5039236) (← links)
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs (Q5045248) (← links)
- The complexity of colouring circle graphs (Q5096797) (← links)
- Distance Hereditary Graphs and the Interlace Polynomial (Q5428369) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
- A few words about maps (Q6563994) (← links)
- Treewidth, circle graphs and circular drawings (Q6630449) (← links)
