The following pages link to (Q5588432):
Displaying 50 items.
- Unit and proper tube orders (Q953272) (← links)
- Some remarks on the geodetic number of a graph (Q965962) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- Characterising \((k,\ell )\)-leaf powers (Q968117) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- On the computation of the hull number of a graph (Q1045055) (← links)
- A dynamic distributed approach to representing proper interval graphs (Q1045060) (← links)
- Finding Hamiltonian circuits in proper interval graphs (Q1050117) (← links)
- Interval graphs and interval orders (Q1060230) (← links)
- Applications of the theory of meaningfulness to psychology (Q1088612) (← links)
- On the null-homotopy of bridged graphs (Q1099187) (← links)
- A characterization of interval catch digraphs (Q1118608) (← links)
- Difference measurement spaces (Q1161518) (← links)
- Lukasiewicz logic and the foundations of measurement (Q1163536) (← links)
- An application of vertex packing to data analysis in the evaluation of pavement deterioration (Q1165769) (← links)
- Norbert Wiener on the theory of measurement (1914, 1915, 1921) (Q1193374) (← links)
- A new characterization of proper interval graphs (Q1199478) (← 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)
- Comparability graphs and a new matroid (Q1235707) (← links)
- A short proof that `proper = unit' (Q1301726) (← links)
- On chordal proper circular arc graphs (Q1322203) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- On properties of unit interval graphs with a perceptual motivation (Q1377473) (← links)
- Short proofs for interval digraphs (Q1377823) (← links)
- Proper and unit bitolerance orders and graphs (Q1381846) (← links)
- Unit disk graph recognition is NP-hard (Q1384186) (← links)
- Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
- Separability generalizes Dirac's theorem (Q1392561) (← links)
- 2-role assignments on triangulated graphs. (Q1401397) (← links)
- NeST graphs (Q1613397) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- On the classes of interval graphs of limited nesting and count of lengths (Q1739103) (← links)
- Chromatic quasisymmetric functions of directed graphs (Q1745178) (← links)
- Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
- Recognition and characterization of unit interval graphs with integer endpoints (Q1752493) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
- Koszul binomial edge ideals of pairs of graphs (Q1794075) (← links)
- Paired threshold graphs (Q1801073) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
- AT-free graphs: Linear bounds for the oriented diameter (Q1827858) (← links)
- A characterisation of rigid circuit graphs (Q1846437) (← links)
- Representing a concept lattice by a graph (Q1885806) (← links)
- Proper and unit tolerance graphs (Q1894354) (← links)
- On edge transitivity of directed graphs (Q1894773) (← links)
