Recognition of Circle Graphs
From MaRDI portal
Recommendations
- Publication:4724662
- scientific article; zbMATH DE number 5130726
- Practical and efficient circle graph recognition
- Recognizing circle graphs in polynomial time
- Linear-time recognition of circular-arc graphs
- Fully dynamic recognition of proper circular-arc graphs
- scientific article; zbMATH DE number 3970805
- A simpler linear-time recognition of circular-arc graphs
- A Simpler Linear-Time Recognition of Circular-Arc Graphs
- A characterization of circle graphs
Cited in
(58)- The complexity of recognizing geometric hypergraphs
- scientific article; zbMATH DE number 3933116 (Why is no real title available?)
- Parameterized domination in circle graphs
- scientific article; zbMATH DE number 2230201 (Why is no real title available?)
- The complexity of recognizing geometric hypergraphs
- The interlace polynomial of a graph
- Minimum weight feedback vertex sets in circle graphs
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Fully dynamic recognition of proper circular-arc graphs
- NP-completeness results for edge modification problems
- Approximating the minimum clique cover and other hard problems in subtree filament graphs
- Approximation algorithms for vertex-connectivity augmentation on the cycle
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- Recognition of unit segment and polyline graphs is \(\exists \mathbb{R} \)-complete
- Extending partial representations of circle graphs in near-linear time
- Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
- A characterization of circle graphs in terms of multimatroid representations
- Euler circuits and DNA sequencing by hybridization
- Splitting cubic circle graphs
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Collective additive tree spanners for circle graphs and polygonal graphs
- Simultaneous dominance representation of multiple posets
- Recognizing circle graphs in polynomial time
- A proof of a circle graph characterization
- Circle criteria in recursive identification
- Word-representability of graphs with respect to split recomposition
- Counting hexagonal patches and independent sets in circle graphs
- Solving some NP-complete problems using split decomposition
- Practical and efficient split decomposition via graph-labelled trees
- The expansion of a chord diagram and the Tutte polynomial
- From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
- Describing realizable Gauss diagrams using the concepts of parity or bipartite graphs
- APX-hardness of domination problems in circle graphs
- New tools to study 1-11-representation of graphs
- Notes on a theorem of Naji
- Practical and efficient circle graph recognition
- Partial characterizations of circle graphs
- Container ship stowage problem complexity and connection to the coloring of circle graphs
- Simultaneous contact representations of planar graphs
- Isotropic matroids. II: Circle graphs
- scientific article; zbMATH DE number 7651152 (Why is no real title available?)
- Circle graphs and monadic second-order logic
- Diamond-free circle graphs are Helly circle
- Reducing prime graphs and recognizing circle graphs
- On polygon numbers of circle graphs and distance hereditary graphs
- Recognizing generalized transmission graphs of line segments and circular sectors
- Interlace polynomials: enumeration, unimodality and connections to codes
- The complexity of colouring circle graphs (extended abstract)
- A (1.5+)-approximation algorithm for weighted connectivity augmentation
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Intersection representations of matrices by subtrees and unicycles on graphs
- Succinct navigational oracles for families of intersection graphs on a circle
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model
- Line digraphs of polytrees
- Circle graph isomorphism in almost linear time
- scientific article; zbMATH DE number 2230199 (Why is no real title available?)
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
- Distributed interactive proofs for the recognition of some geometric intersection graph classes
This page was built for publication: Recognition of Circle Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285912)
