Pages that link to "Item:Q1116953"
From MaRDI portal
The following pages link to Reducing prime graphs and recognizing circle graphs (Q1116953):
Displaying 50 items.
- Notes on a theorem of Naji (Q329556) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Practical and efficient circle graph recognition (Q472484) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- The transition matroid of a 4-regular graph: an introduction (Q491757) (← links)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- On the linear algebra of local complementation (Q665929) (← links)
- Recognizing locally equivalent graphs (Q685658) (← links)
- Splitting cubic circle graphs (Q726651) (← links)
- Isotropic matroids. II: Circle graphs (Q727169) (← links)
- Unavoidable vertex-minors in large prime graphs (Q740266) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Diamond-free circle graphs are Helly circle (Q965965) (← links)
- \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
- Graph theoretic approach to parallel gene assembly (Q1003730) (← links)
- Circle graphs and the cycle double cover conjecture (Q1025572) (← links)
- Isotropic systems (Q1101116) (← links)
- Graphic presentations of isotropic systems (Q1113912) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Thresholds for classes of intersection graphs (Q1201264) (← links)
- Classes and recognition of curve contact graphs (Q1272471) (← links)
- Minimally 3-connected isotropic systems (Q1340133) (← links)
- Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs (Q1356405) (← links)
- Covering and coloring polygon-circle graphs (Q1356563) (← 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)
- FO model checking on geometric graphs (Q1631773) (← links)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- On a Hopf algebra in graph theory (Q1850488) (← links)
- On edge transitivity of directed graphs (Q1894773) (← links)
- A 2-isomorphism theorem for delta-matroids (Q2020041) (← links)
- Forbidden induced subgraph characterization of circle graphs within split graphs (Q2091783) (← links)
- Rank connectivity and pivot-minors of graphs (Q2107500) (← links)
- Topology and counting of real algebraic curves (Q2149421) (← links)
- 2-nested matrices: towards understanding the structure of circle graphs (Q2152610) (← links)
- Isotropic matroids. III: Connectivity (Q2363112) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
- Interlacement and activities in delta-matroids (Q2422209) (← links)
- Counting hexagonal patches and independent sets in circle graphs (Q2429365) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- Mutant knots and intersection graphs (Q2464924) (← links)
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard (Q2945185) (← links)
- Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search (Q3060200) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- The Pure Prime Circle Orbit Conjecture (Q3439328) (← links)
- Weighted Interlace Polynomials (Q3557529) (← links)
- Digraph Decompositions and Eulerian Systems (Q3781773) (← links)
- The complexity of colouring circle graphs (Q5096797) (← links)
- (Q5111878) (← links)
