Matrix characterizations of circular-arc graphs

Cited In (64)

Counting kernels in directed graphs with arbitrary orientations
Foreground memory management in data path synthesis
Lexicographic orientation algorithms
On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs
On semi-transitive orientability of split graphs
Hadwiger's conjecture for proper circular arc graphs
The circular dimension of a graph
Title not available (Why is that?)
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
Approximation and fixed-parameter algorithms for consecutive ones submatrix 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
Circular-arc bigraphs and its subclasses
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
Intersection graphs of paths in a tree
Short proofs for interval digraphs
Graph isomorphism and identification matrices: Sequential algorithms
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree 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
Dual parameterization of weighted coloring
An O(qn) algorithm to q-color a proper family of circular arcs
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
Interval bigraphs and circular arc graphs
New characterizations of proper interval bigraphs
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
Circular‐arc digraphs: A characterization
Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
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
Extending partial representations of circular-arc graphs
Intersection representations of matrices by subtrees and unicycles on graphs
On grid intersection graphs
The Complexity of Coloring Circular Arcs and Chords
Recognizing hidden bicircular networks
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
A selected tour of the theory of identification matrices
Circularly compatible ones, $D$-circularity, and proper circular-arc bigraphs
Circular-arc hypergraphs: rigidity via connectedness
A structure theorem for the consecutive 1's property
Representing digraphs using intervals or circular arcs
Representations of graphs and networks (coding, layouts and embeddings)

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)