Pages that link to "Item:Q3290351"
From MaRDI portal
The following pages link to Representation of a finite graph by a set of intervals on the real line (Q3290351):
Displaying 50 items.
- Graphs with induced-saturation number zero (Q276201) (← links)
- Castelnuovo-Mumford regularity under reduction processes on graphs and hypergraphs (Q277508) (← links)
- Structural parameterizations for boxicity (Q289935) (← links)
- On models of directed path graphs non rooted directed path graphs (Q292267) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q293448) (← links)
- Bandwidth of chain graphs (Q293476) (← links)
- On unit interval graphs with integer endpoints (Q324887) (← links)
- Strictly interval graphs: characterization and linear time recognition (Q325435) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- A note on path domination (Q339493) (← links)
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
- Max point-tolerance graphs (Q344833) (← links)
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- Recognition and characterization of chronological interval digraphs (Q396800) (← links)
- Reduced clique graphs of chordal graphs (Q412263) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- Computing feasible toolpaths for 5-axis machines (Q443707) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs (Q468443) (← links)
- On the non-unit count of interval graphs (Q496432) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- End-vertices of LBFS of (AT-free) bigraphs (Q528559) (← links)
- A structural characterization for certifying Robinsonian matrices (Q529005) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
- Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges (Q556849) (← links)
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- Reconstruction of interval graphs (Q604467) (← links)
- Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Some properties of edge intersection graphs of single-bend paths on a grid (Q658070) (← links)
- Boxicity of leaf powers (Q659669) (← links)
- Minimal obstructions for partial representations of interval graphs (Q668026) (← links)
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- Interval competition graphs of symmetric digraphs (Q688262) (← links)
- Two-step graphs of trees (Q688263) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- A Ramsey-type theorem and its application to relatives of Helly's theorem (Q759161) (← links)
- Representation theorems for graphs whose vertex set is partially ordered (Q762181) (← links)
- On the stab number of rectangle intersection graphs (Q778517) (← links)
- A lower bound for the interval number of a graph (Q788751) (← links)
- Some aspects of perfect elimination orderings in chordal graphs (Q792351) (← links)
- Interval line graphs (Q795846) (← links)
- Tolerance graphs (Q798675) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
- Combining overlap and containment for gene assembly in ciliates (Q847668) (← links)
- The structure of bi-arc trees (Q864126) (← links)
- Tree representations of graphs (Q875046) (← links)
