Pages that link to "Item:Q3290351"

The following pages link to Representation of a finite graph by a set of intervals on the real line (Q3290351):

Displayed 50 items.

• 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)
• 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)
• 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)
• 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)
• The structure of bi-arc trees (Q864126) ‎ (← links)
• Tree representations of graphs (Q875046) ‎ (← links)
• Tree loop graphs (Q876466) ‎ (← links)
• Recognizing graphs without asteroidal triples (Q876727) ‎ (← links)
• On CCE graphs of doubly partial orders (Q881574) ‎ (← links)
• An evolution of interval graphs (Q912869) ‎ (← links)
• An optimal greedy heuristic to color interval graphs (Q922724) ‎ (← links)
• Some remarks on interval graphs (Q1050372) ‎ (← links)
• Interval graphs and interval orders (Q1060230) ‎ (← links)
• Finding Hamiltonian circuits in interval graphs (Q1066674) ‎ (← links)
• Homogeneously representable interval graphs (Q1066922) ‎ (← links)
• Interval graphs and maps of DNA (Q1071684) ‎ (← links)
• Neighborhood perfect graphs (Q1081622) ‎ (← links)
• Finding the minimum bandwidth of an interval graph (Q1090458) ‎ (← links)
• On the problem of how to represent a graph taking into account an additional structure (Q1101469) ‎ (← links)
• Posets with interval upper bound graphs (Q1104348) ‎ (← links)
• Fuzzy intersection graphs (Q1107547) ‎ (← links)
• Random interval graphs (Q1112069) ‎ (← links)
• A characterization of interval catch digraphs (Q1118608) ‎ (← links)
• Simplicial decompositions of graphs: A survey of applications (Q1118617) ‎ (← links)
• End vertices in interval graphs (Q1119662) ‎ (← links)
• On dimensional properties of graphs (Q1121914) ‎ (← links)
• A characterization of Robert's inequality for boxicity (Q1132899) ‎ (← links)
• Extremal values of the interval number of a graph. II (Q1145706) ‎ (← links)
• Extremal values of the interval number of a graph, II (Q1149452) ‎ (← links)
• On minimal augmentation of a graph to obtain an interval graph (Q1154281) ‎ (← links)
• The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph (Q1166545) ‎ (← links)
• On grid intersection graphs (Q1174140) ‎ (← links)
• Short-chorded and perfect graphs (Q1174781) ‎ (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) ‎ (← links)
• Intersection properties of graphs (Q1175421) ‎ (← links)
• Norbert Wiener on the theory of measurement (1914, 1915, 1921) (Q1193374) ‎ (← links)
• A new characterization of proper interval graphs (Q1199478) ‎ (← links)
• d-collapsing and nerves of families of convex sets (Q1218654) ‎ (← links)
• A recognition algorithm for the intersection graphs of directed paths in directed trees (Q1219893) ‎ (← links)
• Comparability graphs and a new matroid (Q1235707) ‎ (← links)
• Information storage and retrieval - mathematical foundations. II: Combinatorial problems (Q1235990) ‎ (← links)
• Information storage and retrieval systems: Mathematical foundations (Q1236883) ‎ (← links)