The following pages link to (Q4828541):
Displaying 23 items.
- The \(k\)-edge intersection graphs of paths in a tree (Q2473042) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- A matrix characterization of interval and proper interval graphs (Q2483137) (← links)
- A characterization of triangle-free tolerance graphs (Q2489942) (← links)
- Range of the fractional weak discrepancy function (Q2503151) (← links)
- A characterization of 2-tree probe interval graphs (Q2509539) (← links)
- Containment graphs and posets of paths in a tree: wheels and partial wheels (Q2663167) (← links)
- New geometric representations and domination problems on tolerance and multitolerance graphs (Q2820855) (← links)
- Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time (Q2945191) (← links)
- Induced Separation Dimension (Q3181052) (← links)
- A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650) (← links)
- (Q3984740) (← links)
- On central max-point-tolerance graphs (Q4956231) (← links)
- Generating Posets Beyond N (Q5098715) (← links)
- Fuzzy <i>k</i>-Competition Graphs and <i>p</i>-Competition Fuzzy Graphs (Q5216846) (← links)
- Intersection graphs of homothetic polygons (Q5301023) (← links)
- What Is between Chordal and Weakly Chordal Graphs? (Q5302062) (← links)
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial (Q5499731) (← links)
- Efficient Local Representations of Graphs (Q5506777) (← links)
- Product throttling for power domination (Q5883635) (← links)
- Linear-Time Recognition of Probe Interval Graphs (Q5899485) (← links)
- Multithreshold multipartite graphs (Q6057899) (← links)
- Containment orders – a lifelong journey (Q6643354) (← links)
