In graph theory, an interval graph is an undirected graph formed from a set of intervals on the real line, with a vertex for each interval and an edge...

Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...

triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs". Journal of Graph Theory. 6 (3):...

throughput. It is equivalent to finding a maximum independent set in an interval graph. A generalization of the problem considers k > 1 {\displaystyle k>1}...

set of intervals on a line is called the interval graph. String graphs, the intersection graphs of curves in the plane, include circle graphs as a special...

graph Dense graph Dipole graph Directed acyclic graph Directed graph Distance regular graph Distance-transitive graph Edge-transitive graph Interval graph...

Using liveness analysis, an interference graph can be built. The interference graph, which is an Interval graph where the nodes are the program's variables...

decomposition of a graph is also the junction tree of the junction tree algorithm. Interval graphs are the intersection graphs of subtrees of path graphs, a special...

3-edge-colorable graphs is APX-complete. An interval graph is a graph in which the nodes are 1-dimensional intervals (e.g. time intervals) and there is an...

In computer science, a control-flow graph (CFG) is a representation, using graph notation, of all paths that might be traversed through a program during...

given graph is a subgraph. Interval graphs are a special case of chordal graphs, and chordal graphs can be represented as intersection graphs of subtrees...

(geometry) Inequality Interval graph Interval finite element Interval (statistics) Line segment Partition of an interval Unit interval Bertsekas, Dimitri...

measurement Interval estimate Interval (graph theory) Space-time interval, the distance between two points in 4-space Intermission, (British English: interval),...

Planar graphs (In fact, planar graph isomorphism is in log space, a class contained in P) Interval graphs Permutation graphs Circulant graphs Bounded-parameter...

proper interval graphs of graphs having bandwidth k {\displaystyle k} . These graphs are called cyclically interval graphs because the intervals can be...

In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain...

intersection graph of intervals on the real line, or of connected subgraphs of a path graph. An indifference graph may be defined as the intersection graph of unit...

graph all of whose induced subgraphs have the property that any maximal clique intersects any maximal independent set in a single vertex. An interval...

be computed in linear time for interval graphs, and in near-linear time for graphs of bounded treewidth. In median graphs, the diameter can be found in...

postdominate any other strict postdominators of n. Control-flow graph Interval (graph theory) Static single assignment form Lengauer, Thomas; Tarjan,...

bounded-degree planar graphs, split graphs, bipartite graphs and their complements, line graphs of bipartite graphs, unit disk graphs, interval graphs of diameter...

In mathematics, the interval chromatic number X<(H) of an ordered graph H is the minimum number of intervals the (linearly ordered) vertex set of H can...

of interval representations, these graphs are also called unit interval graphs or proper interval graphs; they form a subclass of the interval graphs. The...

"NP-completeness of the problem of finding a minimum-clique-number interval graph containing a given graph as a subgraph". Proceedings. International Symposium on...

recognition algorithm. Circular-arc graphs are a natural generalization of interval graphs. If a circular-arc graph G has an arc model that leaves some...

called an interval order. Interval graphs are exactly the graphs that are chordal and that have comparability graph complements. A permutation graph is a containment...

Meyniel graphs contain the chordal graphs, the parity graphs, and their subclasses the interval graphs, distance-hereditary graphs, bipartite graphs, and...

In graph theory, interval edge coloring is a type of edge coloring in which edges are labeled by the integers in some interval, every integer in the interval...

self-complementary graph, a block graph, a split graph, an interval graph, a claw-free graph, a 1-vertex-connected graph and a 1-edge-connected graph. A graph is bull-free...

In graph theory, a d-interval hypergraph is a kind of a hypergraph constructed using intervals of real lines. The parameter d is a positive integer. The...