Pages that link to "Item:Q4207921"
From MaRDI portal
The following pages link to Circular‐arc digraphs: A characterization (Q4207921):
Displaying 25 items.
- Circular-arc hypergraphs: rigidity via connectedness (Q516817) (← links)
- Adjacency matrices of probe interval graphs (Q608289) (← links)
- Boxicity of circular arc graphs (Q659754) (← links)
- Two remarks on circular arc graphs (Q675889) (← links)
- Irredundancy in circular arc graphs (Q686248) (← links)
- The distribution of the relative arc density of a family of interval catch digraph based on uniform data (Q715495) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- An interval digraph in relation to its associated bipartite graph (Q1313853) (← links)
- Short proofs for interval digraphs (Q1377823) (← links)
- Representing digraphs using intervals or circular arcs (Q1910520) (← links)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- 2-nested matrices: towards understanding the structure of circle graphs (Q2152610) (← links)
- Graphs and digraphs represented by intervals and circular arcs (Q2357159) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- Chronological orderings of interval digraphs (Q2497527) (← links)
- Contact Graphs of Circular Arcs (Q3449800) (← links)
- Partial Characterizations of Circular-Arc Graphs (Q3503529) (← links)
- Unit Circular-Arc Graph Representations and Feasible Circulations (Q3614215) (← links)
- Partial characterizations of circular-arc graphs (Q3652535) (← links)
- Intersection representation of digraphs in trees with few leaves (Q4719324) (← links)
- Naji's characterization of circle graphs (Q5110642) (← links)
- Domination number of an interval catch digraph family and its use for testing uniformity (Q5222209) (← links)
- Circular‐Arc Bigraphs and Its Subclasses (Q5325948) (← links)
- Comparability digraphs: an analogue of comparability graphs (Q6177431) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)
