The following pages link to (Q5588432):
Displaying 50 items.
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- Clique-width of path powers (Q266933) (← links)
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- Consecutive retrieval property -- revisited (Q294594) (← links)
- The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
- On unit interval graphs with integer endpoints (Q324887) (← links)
- Strictly interval graphs: characterization and linear time recognition (Q325435) (← links)
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
- Thin strip graphs (Q344860) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Random generation and enumeration of bipartite permutation graphs (Q414425) (← links)
- Unit and single point interval graphs (Q427904) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- A faster algorithm for the cluster editing problem on proper interval graphs (Q495665) (← links)
- Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003) (← links)
- On the non-unit count of interval graphs (Q496432) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- A structural characterization for certifying Robinsonian matrices (Q529005) (← links)
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- Fractional weak discrepancy and split semiorders (Q531608) (← links)
- Space graphs and sphericity (Q595671) (← links)
- Reconstructibility and perfect graphs (Q595687) (← links)
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- Simple linear time recognition of unit interval graphs (Q672408) (← links)
- \(\phi\)-threshold and \(\phi\)-tolerance chain graphs (Q686259) (← links)
- Interval competition graphs of symmetric digraphs (Q688262) (← links)
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- Mixed unit interval graphs (Q713160) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
- On-line chain partitions of orders: a survey (Q766153) (← links)
- On the sphericity and cubicity of graphs (Q789416) (← links)
- Interval line graphs (Q795846) (← links)
- Tolerance graphs (Q798675) (← links)
- Clique graphs of time graphs (Q798677) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- Thinness of product graphs (Q831864) (← links)
- Uniform embeddings for Robinson similarity matrices (Q832894) (← links)
- Gridline indifference graphs (Q868216) (← links)
- Tangent circle graphs and `orders' (Q869563) (← links)
- Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
- New characterizations of proper interval bigraphs (Q896097) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
