The following pages link to (Q5588432):
Displaying 50 items.
- Integral mixed unit interval graphs (Q1949108) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- Weighted domination of independent sets (Q2000566) (← links)
- Graphs of interval count two with a given partition (Q2015148) (← links)
- A characterization of interval orders with semiorder dimension two (Q2022521) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← links)
- The hull number in the convexity of induced paths of order \(3\) (Q2077392) (← links)
- The co-secure domination in proper interval graphs (Q2078841) (← links)
- Precedence thinness in graphs (Q2091785) (← links)
- The weighted sitting closer to friends than enemies problem in the line (Q2099388) (← 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)
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals (Q2168562) (← links)
- Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) (← links)
- Perfect elimination orderings for symmetric matrices (Q2174877) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
- On strict (outer-)confluent graphs (Q2206846) (← links)
- Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit (Q2230920) (← links)
- A characterization of 2-tree proper interval 3-graphs (Q2249945) (← links)
- On the Carathéodory and exchange numbers of geodetic convexity in graphs (Q2283030) (← links)
- Block-indifference graphs: characterization, structural and spectral properties (Q2328093) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- Clique-width of full bubble model graphs (Q2341723) (← links)
- Extending partial representations of subclasses of chordal graphs (Q2344737) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- On the thinness and proper thinness of a graph (Q2414456) (← links)
- Characterizing interval graphs which are probe unit interval graphs (Q2416421) (← links)
- The \(k\)-in-a-path problem for claw-free graphs (Q2428671) (← links)
- Recognition of probe proper interval graphs (Q2440119) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- The Roberts characterization of proper and unit interval graphs (Q2461218) (← links)
- Packing triangles in low degree graphs and indifference graphs (Q2476287) (← links)
- Precoloring extension on unit interval graphs (Q2492199) (← links)
- Sphericity, cubicity, and edge clique covers of graphs (Q2495913) (← links)
- Non-unit free triangle orders (Q2503150) (← links)
- A finite non-unit free triangle order (Q2503152) (← links)
- On the compatibility between a graph and a simple order (Q2533745) (← links)
- Intransitive indifference with unequal indifference intervals (Q2537977) (← links)
- On nontransitive indifference (Q2542398) (← links)
- A structure theorem for the consecutive 1's property (Q2543431) (← links)
- Betweenness, orders and interval graphs (Q2546051) (← links)
- Conditions for the representation of absolute judgment and pair comparison isosensitivity curves by cumulative distributions (Q2550002) (← links)
- The intersection graphs of subtrees in trees are exactly the chordal graphs (Q2562090) (← links)
