The following pages link to (Q5588432):
Displaying 50 items.
- Structure theorems for some circular-arc graphs (Q2563173) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- Unit ball graphs on geodesic spaces (Q2657071) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- A new representation of proper interval graphs with an application to clique-width (Q2839207) (← links)
- Short models for unit interval graphs (Q2840545) (← links)
- Probe interval and probe unit interval graphs on superclasses of cographs (Q2840732) (← links)
- Unit interval graphs: a story with open ends (Q2857436) (← links)
- Completion of the Mixed Unit Interval Graphs Hierarchy (Q2948474) (← links)
- Computing Role Assignments of Proper Interval Graphs in Polynomial Time (Q3000505) (← links)
- Measuring Indifference: Unit Interval Vertex Deletion (Q3057628) (← links)
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
- Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
- The Interval Count of a Graph (Q3658027) (← links)
- Double Semiorders and Double Indifference Graphs (Q3669466) (← links)
- Maximum Semiorders in Interval Orders (Q3963053) (← links)
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- (Q5075828) (← links)
- On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
- (Q5089227) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q5136273) (← links)
- From a Circular-Arc Model to a Proper Circular-Arc Model (Q5302066) (← links)
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition (Q5351862) (← links)
- Counting and enumerating unlabeled split–indifference graphs (Q5370830) (← links)
- An Optimization Parameter for Seriation of Noisy Data (Q5376542) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- On coloring problems with local constraints (Q5891093) (← links)
- On coloring problems with local constraints (Q5891606) (← links)
- A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)
- Dynamic storage allocation with known durations (Q5918029) (← links)
- The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
- Hardness and structural results for half-squares of restricted tree convex bipartite graphs (Q5919674) (← links)
- Query minimization under stochastic uncertainty (Q5925528) (← links)
- Asteroidal triples of moplexes (Q5939228) (← links)
- An approximation result for a periodic allocation problem (Q5946816) (← links)
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
- Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
- Interval graphs with side (and size) constraints (Q6102297) (← links)
- Approximating the bandwidth for asteroidal triple-free graphs (Q6102320) (← links)
- Maximum cut on interval graphs of interval count four is NP-complete (Q6124829) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- The weak-toll function of a graph: axiomatic characterizations and first-order non-definability (Q6547838) (← links)
- Connected proper interval graphs and the guard problem in spiral polygons (extended abstract) (Q6567668) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)
- Moduli spaces of geometric graphs (Q6596249) (← links)
- Weakly toll convexity and proper interval graphs (Q6606986) (← links)
- Modification problems toward proper (Helly) circular-arc graphs (Q6647753) (← links)
- Semi-proper interval graphs (Q6648246) (← links)
