Characterizing circular-arc graphs
From MaRDI portal
Publication:5602682
Cites work
- scientific article; zbMATH DE number 3145756 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- Incidence matrices and interval graphs
- Incidence matrices, interval graphs and seriation in archeology
- Representation of a finite graph by a set of intervals on the real line
Cited in
(29)- Canonical representations for circular-arc graphs using flip sets
- Representation characterizations of chordal bipartite graphs
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- 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
- Obstacle numbers of graphs
- Partial characterizations of 1-perfectly orientable graphs
- Algorithms and complexity of sandwich problems in graphs (extended abstract)
- Short proofs for interval digraphs
- Graphs of edge-intersecting and non-splitting paths
- Extremal Values of the Interval Number of a Graph
- On linear and circular structure of (claw, net)-free graphs
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Graph theory
- Intersection graphs of Helly families of subtrees
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
- Hamiltonian circuits in interval graph generalizations
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Finding cut-vertices in the square roots of a graph
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- On dimensional properties of graphs
- A linear-time algorithm for clique-coloring problem in circular-arc graphs
- On coherent configuration of circular-arc graphs
- Circularly compatible ones, \(D\)-circularity, and proper circular-arc bigraphs
- Describing hereditary properties by forbidden circular orderings
- Compact distributed certification of geometric graph classes
This page was built for publication: Characterizing circular-arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5602682)
