The following pages link to (Q4250178):
Displaying 36 items.
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- A structural characterization for certifying Robinsonian matrices (Q529005) (← links)
- An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
- Mixed unit interval graphs (Q713160) (← links)
- Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← links)
- On end-vertices of lexicographic breadth first searches (Q968161) (← links)
- A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
- On compact and efficient routing in certain graph classes (Q997073) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- A new characterization of proper interval graphs (Q1199478) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← 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)
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
- Integral mixed unit interval graphs (Q1949108) (← links)
- A fully dynamic graph algorithm for recognizing interval graphs (Q1957648) (← links)
- New results on induced matchings (Q1975379) (← links)
- Can transitive orientation make sandwich problems easier? (Q2370442) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- Characterizing interval graphs which are probe unit interval graphs (Q2416421) (← links)
- A matrix characterization of interval and proper interval graphs (Q2483137) (← links)
- Fast algorithms for identifying maximal common connected sets of interval graphs (Q2499592) (← links)
- Unit interval graphs: a story with open ends (Q2857436) (← links)
- A Characterization of Mixed Unit Interval Graphs (Q2945201) (← links)
- A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650) (← links)
- Approximate <i>L</i>(δ<sub>1</sub>,δ<sub>2</sub>,…,δ<sub><i>t</i></sub>)‐coloring of trees and interval graphs (Q3442863) (← links)
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs (Q3605497) (← links)
- (Q4590888) (← links)
- Unit Interval Graphs of Open and Closed Intervals (Q4916100) (← links)
- Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs (Q5317569) (← links)
- A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs (Q5941505) (← links)
- Recognizing interval bigraphs by forbidden patterns (Q6081553) (← links)
- A characterization of unit interval bigraphs of open and closed intervals (Q6184331) (← links)