Pages that link to "Item:Q2548968"
From MaRDI portal
The following pages link to Matrix characterizations of circular-arc graphs (Q2548968):
Displaying 50 items.
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
- Circular-arc hypergraphs: rigidity via connectedness (Q516817) (← links)
- A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
- Efficient parallel recognition of some circular arc graphs. II (Q675297) (← links)
- Two remarks on circular arc graphs (Q675889) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- New characterizations of proper interval bigraphs (Q896097) (← links)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Obstacle numbers of graphs (Q977184) (← links)
- Hadwiger's conjecture for proper circular arc graphs (Q1024291) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- An O(qn) algorithm to q-color a proper family of circular arcs (Q1060020) (← links)
- Intersection graphs of paths in a tree (Q1077439) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- On grid intersection graphs (Q1174140) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- On the structure of locally semicomplete digraphs (Q1198647) (← links)
- Recognizing hidden bicircular networks (Q1208462) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- A recognition algorithm for the intersection graphs of directed paths in directed trees (Q1219893) (← links)
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets (Q1237785) (← links)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450) (← links)
- The circular dimension of a graph (Q1251675) (← links)
- Short proofs for interval digraphs (Q1377823) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- A selected tour of the theory of identification matrices (Q1575436) (← links)
- An extension of a theorem of Fulkerson and Gross (Q1816927) (← links)
- A good submatrix is hard to find (Q1836717) (← links)
- Representing digraphs using intervals or circular arcs (Q1910520) (← links)
- Graph isomorphism and identification matrices: Sequential algorithms (Q1970201) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Cyclic arrangements with minimum modulo \(m\) winding numbers (Q2117515) (← links)
- The chromatic index of proper circular-arc graphs of odd maximum degree which are chordal (Q2132339) (← links)
- Tuple domination on graphs with the consecutive-zeros property (Q2132374) (← links)
- 2-nested matrices: towards understanding the structure of circle graphs (Q2152610) (← links)
- Essential obstacles to Helly circular-arc graphs (Q2166233) (← links)
- Graphs and digraphs represented by intervals and circular arcs (Q2357159) (← links)
- Proper circular arc graphs as intersection graphs of paths on a grid (Q2416437) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- A structure theorem for the consecutive 1's property (Q2543431) (← links)
- The intersection graphs of subtrees in trees are exactly the chordal graphs (Q2562090) (← links)
- Structure theorems for some circular-arc graphs (Q2563173) (← links)
- Lexicographic Orientation Algorithms (Q3120444) (← links)
- Circular permutation graphs (Q4745855) (← links)
- Interval bigraphs and circular arc graphs (Q4810505) (← links)
- Circular‐Arc Bigraphs and Its Subclasses (Q5325948) (← links)
- On semi-transitive orientability of split graphs (Q6121421) (← links)
