An Efficient Test for Circular-Arc Graphs
From MaRDI portal
Cited in
(52)- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- Maximum bipartite subgraphs of geometric intersection graphs
- Precoloring extension. I: Interval graphs
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
- Minimum entropy combinatorial optimization problems
- Graphs and digraphs represented by intervals and circular arcs
- Lexicographic orientation algorithms
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Linear-time recognition of Helly circular-arc models and graphs
- Circular-arc graphs with clique cover number two
- A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs
- Minimum entropy coloring
- Deferred-query—An efficient approach for problems on interval and circular-arc graphs
- Optimal circular arc representations: Properties, recognition, and construction
- On the structure of certain intersection graphs
- Finding Hamiltonian circuits in proper interval graphs
- Contact representations of planar graphs: extending a partial representation is hard
- Periodic assignment and graph colouring
- Parallel algorithms on circular-arc graphs
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
- Intersection graphs of concatenable subtrees of graphs
- On powers of circular arc graphs and proper circular arc graphs
- Interval routing schemes for circular-arc graphs
- Optimal parallel algorithms on circular-arc graphs
- From a Circular-Arc Model to a Proper Circular-Arc Model
- Completing colored graphs to meet a target property
- On some subclasses of oriented catch digraphs
- An O(qn) algorithm to q-color a proper family of circular arcs
- On a circle-cover minimization problem
- Dominating sets and domatic number of circular arc graphs
- A short proof of the NP-completeness of minimum sum interval coloring
- Reconfiguring shortest paths in graphs
- New characterizations of proper interval bigraphs
- Simultaneous contact representations of planar graphs
- An O(n^2 ) Algorithm for Coloring Proper Circular Arc Graphs
- A simpler linear-time recognition of circular-arc graphs
- Two remarks on circular arc graphs
- On polygon numbers of circle graphs and distance hereditary graphs
- The complexity of colouring circle graphs (extended abstract)
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- A model predictive control approach for discrete-time rescheduling in complex central railway station areas
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
- Tree loop graphs
- Extending partial representations of circular-arc graphs
- The Complexity of Coloring Circular Arcs and Chords
- On coherent configuration of circular-arc graphs
- A constant factor approximation algorithm for boxicity of circular arc graphs
- Efficient parallel recognition of some circular arc graphs. I
- Efficient reduction for path problems on circular-arc graphs
- Representations of graphs and networks (coding, layouts and embeddings)
This page was built for publication: An Efficient Test for Circular-Arc Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3900112)
