Matrix characterizations of circular-arc graphs

Cited in

(66)

Hadwiger's conjecture for proper circular arc graphs
Counting kernels in directed graphs with arbitrary orientations
The circular dimension of a graph
Foreground memory management in data path synthesis
scientific article; zbMATH DE number 2230201 (Why is no real title available?)
Graphs and digraphs represented by intervals and circular arcs
Lexicographic orientation algorithms
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
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
Structure theorems for some circular-arc graphs
Cyclic arrangements with minimum modulo \(m\) winding numbers
Obstacle numbers of graphs
Proper Helly Circular-Arc Graphs
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
Circular-arc bigraphs and its subclasses
Intersection graphs of paths in a tree
Short proofs for interval digraphs
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Graph isomorphism and identification matrices: Sequential algorithms
The chromatic index of proper circular-arc graphs of odd maximum degree which are chordal
Tuple domination on graphs with the consecutive-zeros property
An Optimal Algorithm for Strict Circular Seriation
Extremal Values of the Interval Number of a Graph
On linear and circular structure of (claw, net)-free graphs
Completing colored graphs to meet a target property
On the structure of locally semicomplete digraphs
Characterization problems for graphs, partially ordered sets, lattices, and families of sets
On some subclasses of oriented catch digraphs
Dual parameterization of weighted coloring
An O(qn) algorithm to q-color a proper family of circular arcs
Finding maximum edge bicliques in tree convex graphs
A good submatrix is hard to find
Essential obstacles to Helly circular-arc graphs
2-nested matrices: towards understanding the structure of circle graphs
A recognition algorithm for the intersection graphs of directed paths in directed trees
New characterizations of proper interval bigraphs
Interval bigraphs and circular arc graphs
An extension of a theorem of Fulkerson and Gross
Circular permutation graphs
The intersection graphs of subtrees in trees are exactly the chordal graphs
An O(n^2 ) Algorithm for Coloring Proper Circular Arc Graphs
Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
Circular‐arc digraphs: A characterization
A simpler linear-time recognition of circular-arc graphs
Two remarks on circular arc graphs
Algorithmic aspects of intersection graphs and representation hypergraphs
Efficient parallel recognition of some circular arc graphs. II
Efficient local representations of graphs
Characterizations and recognition of circular-arc graphs and subclasses: a survey
Intersection representations of matrices by subtrees and unicycles on graphs
On grid intersection graphs
Extending partial representations of circular-arc graphs
Recognizing hidden bicircular networks
The Complexity of Coloring Circular Arcs and Chords
Algorithms on circular-arc graphs
A constant factor approximation algorithm for boxicity of circular arc graphs
Efficient parallel recognition of some circular arc graphs. I
On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs
A selected tour of the theory of identification matrices
Circular-arc hypergraphs: rigidity via connectedness
Circularly compatible ones, D-circularity, and proper circular-arc bigraphs
On semi-transitive orientability of split graphs
A structure theorem for the consecutive 1's property
Representations of graphs and networks (coding, layouts and embeddings)
Representing digraphs using intervals or circular arcs

This page was built for publication: Matrix characterizations of circular-arc graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2548968)