Pages that link to "Item:Q3058537"
From MaRDI portal
The following pages link to The LBFS Structure and Recognition of Interval Graphs (Q3058537):
Displaying 44 items.
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- Recognition and characterization of chronological interval digraphs (Q396800) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- Unit and single point interval graphs (Q427904) (← links)
- Interval graph representation with given interval and intersection lengths (Q491160) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- End-vertices of LBFS of (AT-free) bigraphs (Q528559) (← links)
- Minimal obstructions for partial representations of interval graphs (Q668026) (← links)
- On the stab number of rectangle intersection graphs (Q778517) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- A tie-break model for graph search (Q896657) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs (Q1752498) (← links)
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
- Recognizing graph search trees (Q2132337) (← links)
- Happy set problem on subclasses of co-comparability graphs (Q2154092) (← links)
- Graph searches and their end vertices (Q2165035) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Extending partial representations of subclasses of chordal graphs (Q2344737) (← links)
- Robinsonian matrices: recognition challenges (Q2403299) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- Chronological rectangle digraphs which are two-terminal series-parallel (Q2414469) (← links)
- Computing the clique-separator graph for an interval graph in linear time (Q2628270) (← links)
- On the Power of Graph Searching for Cocomparability Graphs (Q2801333) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
- A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) (← links)
- Uniquely Restricted Matchings in Interval Graphs (Q3130447) (← links)
- The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs (Q4987262) (← links)
- The Recognition Problem of Graph Search Trees (Q4997136) (← links)
- (Q5005172) (← links)
- Min-Orderable Digraphs (Q5130576) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition (Q5351862) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- (Q5874479) (← links)
- Recognition and drawing of stick graphs (Q5915944) (← links)
- On rectangle intersection graphs with stab number at most two (Q5919053) (← links)
- Linearizing partial search orders (Q6039439) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- Happy set problem on subclasses of co-comparability graphs (Q6069926) (← links)
- Recognizing interval bigraphs by forbidden patterns (Q6081553) (← links)
