In graph theory, series–parallel graphs are graphs with two distinguished vertices called terminals, formed recursively by two simple composition operations...

outerplanar graphs have boxicity at most two. Every outerplanar graph is a planar graph. Every outerplanar graph is also a subgraph of a series–parallel graph. However...

A series–parallel graph is a graph with two designated terminals s and t that can be formed recursively by combining smaller series–parallel graphs in...

order theory Series–parallel graph in graph theory Series–parallel networks problem, a combinatorial problem about series–parallel graphs This disambiguation...

unlabelled but rooted graphs), corona graph product: it is a non-commutative operation; series–parallel graph composition: parallel graph composition: it is...

trees and directed series–parallel graphs. The comparability graphs of series-parallel partial orders are cographs. Series-parallel partial orders have...

of graphs, cartesian product of graphs, tensor product of graphs, strong product of graphs, lexicographic product of graphs, series–parallel graphs. In...

Nishizeki, Takao; Saito, Nobuji (1981), "Combinatorial problems on series–parallel graphs", Discrete Applied Mathematics, 3 (1): 75–76, doi:10.1016/0166-218X(81)90031-7...

paradox occurs in a two-terminal network if and only if it is not a series-parallel graph. Downs–Thomson paradox – Paradox in traffic engineering related...

cases such as unit disk graphs and planar graphs. A minimum dominating set can be found in linear time in series–parallel graphs. A minimum dominating set...

In graph theory, a threshold graph is a graph that can be constructed from a one-vertex graph by repeated applications of the following two operations:...

and a parallel processing engine to process algorithms and queries. It has its own graph query language that is similar to SQL.: 9–10  TigerGraph also...

In graph theory, a lattice graph, mesh graph, or grid graph is a graph whose drawing, embedded in some Euclidean space ⁠ R n {\displaystyle \mathbb {R}...

node. Efficient distributed parallel algorithms for handling large-scale data are required. The GraphLab framework is a parallel programming abstraction targeted...

the graphs with treewidth 1 are exactly the trees and the forests. An example of graphs with treewidth at most 2 are the series–parallel graphs. The...

A bond graph is a graphical representation of a physical dynamic system. It allows the conversion of the system into a state-space representation. It...

dimension problem even on graphs of treewidth 2, that is, series–parallel graphs. The metric dimension of an arbitrary n-vertex graph may be approximated in...

his survey to series and parallel combinations. MacMahon called these graphs yoke-chains. Ronald M. Foster in 1932 categorised graphs by their nullity...

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...

{\displaystyle k=4} . The graphs with no K 4 {\displaystyle K_{4}} minor are the series–parallel graphs and their subgraphs. Each graph of this type has a vertex...

intree or outtree. sp-graph: The graph of precedence relations is a series parallel graph. bounded height: The length of the longest directed path is capped...

certain classes of graphs, including series–parallel graphs and their subgraphs, which include outerplanar graphs, as well as for a line graph of a tree or...

mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each...

In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it...

intersection graph of the intervals. Interval graphs are chordal graphs and perfect graphs. They can be recognized in linear time, and an optimal graph coloring...

half of the graph's maximal independent sets. This conjecture is known to hold for chordal bipartite graphs, bipartite series–parallel graphs, and bipartite...

components is a series–parallel graph. Wagner's theorem, which characterizes the planar graphs by their forbidden minors, implies that the planar graphs have Hadwiger...

In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color...

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect...

In graph theory, a branch-decomposition of an undirected graph G is a hierarchical clustering of the edges of G, represented by an unrooted binary tree...