The following pages link to Parallel concepts in graph theory (Q1324287):
Displaying 50 items.
- Axioms for consensus functions on undirected phylogenetic trees (Q1060980) (← links)
- Counting spanning trees in the graphs of Kleitman and Golden and a generalization (Q1061129) (← links)
- The maximum number of cliques in dense graphs (Q1061136) (← links)
- Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three (Q1061146) (← links)
- Triangulated edge intersection graphs of paths in a tree (Q1061147) (← links)
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- An approach to the subgraph homeomorphism problem (Q1062457) (← links)
- Analysis of heuristics for finding a maximum weight planar subgraph (Q1062924) (← links)
- Eccentric graphs (Q1066166) (← links)
- Lins-Mandel crystallizations (Q1067259) (← links)
- Structural consequences of individual position in nondyadic social networks (Q1068025) (← links)
- Finding extreme points in three dimensions and solving the post-office problem in the plane (Q1069424) (← links)
- The greedy and Delaunay triangulations are not bad in the average case (Q1069709) (← links)
- The hull number of a graph (Q1070243) (← links)
- 1-homogeneous graphs (Q1072564) (← links)
- Locally geodesic cycles in 2-self-centered graphs (Q1073807) (← links)
- A polynomial algorithm for constructing the clique graph of a line graph (Q1075338) (← links)
- A survey of some problems in combinatorial designs - a matrix approach (Q1076673) (← links)
- On the chromatic uniqueness of bipartite graphs (Q1076684) (← links)
- Switching invariant two-path signed graphs (Q1076698) (← links)
- System structure: stability and controllability (Q1078524) (← links)
- On k-graceful, countably infinite graphs (Q1078581) (← links)
- Hamiltonian threshold graphs (Q1080870) (← links)
- Search problems on graphs (Q1082080) (← links)
- Large minimal sets which force arithmetic progressions (Q1083448) (← links)
- A linear algorithm for embedding planar graphs using PQ-trees (Q1083864) (← links)
- Testing the theory of evolution: A novel application of combinatorial optimization (Q1084042) (← links)
- The computational complexity of inferring rooted phylogenies by parsimony (Q1086183) (← links)
- Finding the two-core of a tree (Q1086244) (← links)
- Sign patterns of matrices and their inverses (Q1087886) (← links)
- The facility layout problem (Q1088577) (← links)
- Construction of crossing-critical graphs (Q1088998) (← links)
- On local convexity in graphs (Q1089354) (← links)
- Combinatorial properties of boundary NLC graph languages (Q1089808) (← links)
- On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large (Q1090340) (← links)
- On combinatorial differential equations (Q1090823) (← links)
- Edge-connectivity augmentation problems (Q1091147) (← links)
- On Hamiltonian cycles in Cayley graphs of wreath products (Q1091398) (← links)
- An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (Q1091829) (← links)
- Steiner problem in Halin networks (Q1092013) (← links)
- A Ramsey problem of Harary on graphs with prescribed size (Q1092061) (← links)
- What can we hope to accomplish in generalized Ramsey theory ? (Q1092924) (← links)
- Some parameters of graph and its complement (Q1094434) (← links)
- On some counting polynomials in chemistry (Q1095908) (← links)
- Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces (Q1095919) (← links)
- On computing a conditional edge-connectivity of a graph (Q1095928) (← links)
- Branching in graphs and molecules (Q1095945) (← links)
- Low density series expansions for backbone properties of percolation clusters (Q1095947) (← links)
- Some applications of graph theory to the study of polymer configuration (Q1095951) (← links)
- Combinatorial characterization of hexagonal systems (Q1095953) (← links)
