The following pages link to Parallel concepts in graph theory (Q1324287):
Displaying 50 items.
- The Steiner problem in phylogeny is NP-complete (Q1167073) (← links)
- Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time (Q1167074) (← links)
- Intersection graphs of k-uniform linear hypergraphs (Q1167187) (← links)
- The analysis of semigroups of multirelational systems (Q1167680) (← links)
- An algorithm for finding optimum path in networks (Q1168880) (← links)
- A graph theoretic approach to switching function minimization (Q1168952) (← links)
- Improvement on Brooks' chromatic bound for a class of graphs (Q1168976) (← links)
- Graphs with eigenvalues at least - 2 (Q1168987) (← links)
- On maximally saturated graphs (Q1169471) (← links)
- Proof of Harary's conjecture on the reconstruction of trees (Q1169484) (← links)
- The edge Hamiltonian path problem is NP-complete (Q1169818) (← links)
- Connected graphs switching equivalent to their iterated line graphs (Q1170205) (← links)
- A simple algorithm to detect balance in signed graphs (Q1170207) (← links)
- Strongly regular graphs and finite Ramsey theory (Q1170268) (← links)
- Extremal regular graphs for the achromatic number (Q1171068) (← links)
- Construction of ergodic transformations (Q1171161) (← links)
- R-domination of block graphs (Q1171499) (← links)
- On the Ramsey multiplicity for stars (Q1172072) (← links)
- Construction of matroidal families by partly closed sets (Q1172644) (← links)
- Minimum number of edges in graphs that are both \(P_ 2-\) and \(P_ i- \)connected (Q1173099) (← links)
- The least point covering and domination numbers of a graph (Q1174131) (← links)
- Trees with 1-factors and oriented trees (Q1174177) (← links)
- On the thickness of graphs of given degree (Q1174334) (← links)
- A necessary and sufficient condition for a graph \(G\) with diameter 5 to be 2-diameter-stable (Q1175425) (← links)
- Stable properties of graphs (Q1175986) (← links)
- Accessibility: A criterion for regularity and hierarchy in visual pattern codes (Q1176279) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- Triangles in 3-connected matroids (Q1179267) (← links)
- Mathematical construction of an autonomous artificial life (Q1180709) (← links)
- Conditioning analysis of sparse block approximate factorizations (Q1181519) (← links)
- Restriction of simple games (Q1181760) (← links)
- On the largest strong components in \(m\)-out digraphs (Q1182737) (← links)
- Random subgraphs of the \(n\)-cycle and the \(n\)-wheel (Q1182873) (← links)
- Strongly indexable graphs (Q1182885) (← links)
- The harmonious coloring number of a graph (Q1182896) (← links)
- On the tree packing problem (Q1183337) (← links)
- Transitive multipermutation graphs: Case \(4\leq n\leq m\) (Q1183982) (← links)
- Tree-partitions of infinite graphs (Q1183985) (← links)
- On-line computation of minimal and maximal length paths (Q1184981) (← links)
- On packing and covering numbers of graphs (Q1185083) (← links)
- Edge colouring line graphs of unicyclic graphs (Q1186166) (← links)
- On the 2-extendability of planar graphs (Q1186375) (← links)
- Optimal fault-tolerant routings for connected graphs (Q1186600) (← links)
- Minimal regular graph containing a given graph (Q1187918) (← links)
- Topological code of graphs (Q1188076) (← links)
- Infiltration games on arbitrary graphs (Q1191856) (← links)
- Generalized Cayley graphs (Q1193449) (← links)
- Exact coverings of 2-paths by Hamilton cycles (Q1193580) (← links)
- Constructing compact rectilinear planar layouts using canonical representation of planar graphs (Q1193898) (← links)
- Reliability analysis of networks using stochastic model (Q1194253) (← links)
