Structure theorems for some circular-arc graphs
From MaRDI portal
Publication:2563173
Cites work
- A structure theorem for the consecutive 1's property
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- scientific article; zbMATH DE number 3342041 (Why is no real title available?)
- Intersection representations of graphs by arcs
- Matrix characterizations of circular-arc graphs
Cited in
(53)- Hadwiger's conjecture for proper circular arc graphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- An O(qn) algorithm to q-color a proper family of circular arcs
- Circular-arc graphs with clique cover number two
- On the problem of how to represent a graph taking into account an additional structure
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Representations of graphs and networks (coding, layouts and embeddings)
- The strong perfect graph conjecture holds for diamonded odd cycle-free graphs
- Efficient parallel recognition of some circular arc graphs. I
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Normal Helly circular-arc graphs and its subclasses
- Proper interval vertex deletion
- Completing colored graphs to meet a target property
- Essential obstacles to Helly circular-arc graphs
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
- Fully dynamic recognition of proper circular-arc graphs
- Graphs and digraphs represented by intervals and circular arcs
- Proper circular arc graphs as intersection graphs of paths on a grid
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Unit ball graphs on geodesic spaces
- Unit interval graphs: a story with open ends
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. I: Theory
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. II: Algorithms
- Proper Interval Vertex Deletion
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection
- Partial Characterizations of Circular-Arc Graphs
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
- Proper Helly Circular-Arc Graphs
- Partial characterizations of circular-arc graphs
- An O(n^2 ) Algorithm for Coloring Proper Circular Arc Graphs
- The Complexity of Coloring Circular Arcs and Chords
- Unit interval graphs of open and closed intervals
- Circularly compatible ones, D-circularity, and proper circular-arc bigraphs
- From a Circular-Arc Model to a Proper Circular-Arc Model
- Circular-arc bigraphs and its subclasses
- Cyclic orders
- An approximation result for a periodic allocation problem
- Extending partial representations of circular-arc graphs
- Partial characterizations of circle graphs
- Boxicity of circular arc graphs
- Modification problems toward proper (Helly) circular-arc graphs
- An extension of a fixed point problem for simple graphs
- Obstructions for local tournament orientation completions with cut-vertices
- On coherent configuration of circular-arc graphs
- On some subclasses of oriented catch digraphs
- Mixed unit interval graphs
- On the complexity of vertex-splitting into an interval graph
- A constant factor approximation algorithm for boxicity of circular arc graphs
- Representation theorems for graphs whose vertex set is partially ordered
- On a circle-cover minimization problem
- Circular representation problem on hypergraphs
- New characterizations of proper interval bigraphs
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
This page was built for publication: Structure theorems for some circular-arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563173)
