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):
Displayed 50 items.
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets (Q1237785) (← links)
- Interval hypergraphs and D-interval hypergraphs (Q1237993) (← links)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450) (← links)
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix (Q1243572) (← links)
- A Turan type problem for interval graphs (Q1251233) (← links)
- The circular dimension of a graph (Q1251675) (← links)
- Representing triangulated graphs in stars (Q1261172) (← links)
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- Induced matchings (Q1262877) (← links)
- Phylogeny numbers (Q1270783) (← links)
- Classes and recognition of curve contact graphs (Q1272471) (← links)
- An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs (Q1273613) (← links)
- Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization (Q1276959) (← links)
- The forbidden subgraph characterization of directed vertex graphs (Q1297413) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- Compatibility between interval structures and partial orderings (Q1331978) (← links)
- Characterizations of two classes of digraphs (Q1336693) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- Recognizing interval digraphs and interval bigraphs in polynomial time (Q1377666) (← links)
- The maximal clique and colourability of curve contact graphs (Q1382253) (← links)
- Separability generalizes Dirac's theorem (Q1392561) (← links)
- Matching and multidimensional matching in chordal and strongly chordal graphs (Q1392565) (← links)
- 2-role assignments on triangulated graphs. (Q1401397) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- Interval degree and bandwidth of a graph (Q1406031) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Interval numbers of powers of block graphs (Q1420587) (← links)
- Hereditary dominating pair graphs (Q1421473) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- Completeness for intersection classes (Q1584399) (← links)
- The structure of obstructions to treewidth and pathwidth (Q1613365) (← links)
- On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications (Q1631662) (← links)
- Graph extremities defined by search algorithms (Q1662546) (← links)
- A width parameter useful for chordal and co-comparability graphs (Q1680525) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- On the classes of interval graphs of limited nesting and count of lengths (Q1739103) (← links)
- Convex and isometric domination of (weak) dominating pair graphs (Q1749540) (← links)
- Recognition and characterization of unit interval graphs with integer endpoints (Q1752493) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802) (← links)
- Constant tolerance intersection graphs of subtrees of a tree (Q1764901) (← links)
- On the Steiner, geodetic and hull numbers of graphs (Q1779492) (← links)
- Dyadic representations of graphs (Q1783614) (← links)
- AT-free graphs: Linear bounds for the oriented diameter (Q1827858) (← links)
- Representing a concept lattice by a graph (Q1885806) (← links)
- Chordal probe graphs (Q1887057) (← links)
- Triangulating graphs without asteroidal triples (Q1917255) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)