Pages that link to "Item:Q4710682"
From MaRDI portal
The following pages link to Recognizing circle graphs in polynomial time (Q4710682):
Displaying 38 items.
- Notes on a theorem of Naji (Q329556) (← links)
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Practical and efficient circle graph recognition (Q472484) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Independence and domination in polygon graphs (Q686246) (← links)
- The interlace polynomial of a graph (Q705880) (← links)
- Unavoidable vertex-minors in large prime graphs (Q740266) (← links)
- On the structure of certain intersection graphs (Q845675) (← links)
- Completely separable graphs (Q908944) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- Diamond-free circle graphs are Helly circle (Q965965) (← links)
- \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
- APX-hardness of domination problems in circle graphs (Q1045943) (← links)
- Reducing prime graphs and recognizing circle graphs (Q1116953) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- The complexity of domination problems in circle graphs (Q1209148) (← 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)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- On edge transitivity of directed graphs (Q1894773) (← links)
- A 2-isomorphism theorem for delta-matroids (Q2020041) (← links)
- On strict (outer-)confluent graphs (Q2206846) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← 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)
- Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way (Q3010409) (← links)
- Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search (Q3060200) (← links)
- O(m logn) Split Decomposition of Strongly Connected Graphs (Q3655150) (← links)
- Digraph Decompositions and Eulerian Systems (Q3781773) (← links)
- An efficient algorithm to generate all maximal independent sets on trapezoid graphs (Q4240618) (← links)
- On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
- The complexity of colouring circle graphs (Q5096797) (← links)
- (Q5708485) (← links)
- From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals (Q6064591) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
- Word-representability of graphs with respect to split recomposition (Q6611031) (← links)
