The following pages link to Parallel concepts in graph theory (Q1324287):
Displaying 50 items.
- The location of central structures in trees (Q1097827) (← links)
- A linear-time algorithm for finding a minimum spanning pseudoforest (Q1098629) (← links)
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- Amortized efficiency of a path retrieval data structure (Q1099629) (← links)
- On the parameter \(v_ 2(h)\) for \(L_ 2\)-coloured graphs (Q1100214) (← links)
- On a generalization of transitivity for digraphs (Q1100476) (← links)
- Some new computer generated results in Ramsey graph theory (Q1100484) (← links)
- Reliability properties of the hypercube network (Q1102261) (← links)
- Automorphism groups and the full state spaces of the Petersen graph generalizations of \(G_{32}\) (Q1102302) (← links)
- The starlike trees which span a hypercube (Q1102977) (← links)
- A survey of the theory of hypercube graphs (Q1102985) (← links)
- Cubical graphs and cubical dimensions (Q1102987) (← links)
- A parallel algorithm for bisection width in trees (Q1103410) (← links)
- Graph graphics: Theory and practice (Q1103411) (← links)
- Connectionist networks qua graphs (Q1103413) (← links)
- Representative graphs of r-regular partial planes and representation of orthomodular posets (Q1103647) (← links)
- On a scheduling problem where a job can be executed only by a limited number of processors (Q1104235) (← links)
- Chromatic polynomials and network reliability (Q1104334) (← links)
- On Ramsey numbers for large disjoint unions of graphs (Q1104338) (← links)
- Wreath products of acts over monoids. I: Regular and inverse acts (Q1104428) (← links)
- Graph theoretic foundations of pathfinder networks (Q1104895) (← links)
- A unique hierarchy on the successive condensations of a digraph (Q1104934) (← links)
- Graphical partially ordered sets (Q1104937) (← links)
- Node-graceful graphs (Q1104944) (← links)
- Ramsey numbers based on \(C_ 5\)-decompositions (Q1106242) (← links)
- A short proof of Kundu's k-factor theorem (Q1106246) (← links)
- A fast backtrack algorithm for graph isomorphism (Q1106855) (← links)
- The number of maximal independent sets in a connected graph (Q1106856) (← links)
- Finding the composite outer boundary and holes of a set of closed curves (Q1107255) (← links)
- Theory of traces (Q1107296) (← links)
- Fuzzy intersection graphs (Q1107547) (← links)
- An application of the planar separator theorem to counting problems (Q1108031) (← links)
- A fast parallel coloring of planar graphs with five colors (Q1108037) (← links)
- Dominating sets in social network graphs (Q1108233) (← links)
- Tight bounds on the spectral radius of asymmetric nonnegative matrices (Q1108348) (← links)
- Fault-tolerant routings in a \(\kappa\)-connected network (Q1109755) (← links)
- Partial triple systems and edge colourings (Q1109776) (← links)
- A linear-processor algorithm for depth-first search in planar graphs (Q1110342) (← links)
- Some models of graphs for scheduling sports competitions (Q1110456) (← links)
- Intersection graphs for families of balls in \(R^n\) (Q1112070) (← links)
- Enumerating phylogenetic trees with multiple labels (Q1112830) (← links)
- The number of spanning trees of the generalized Boolean \(n\)-cube network (Q1113880) (← links)
- On hypergraph acyclicity and graph chordality (Q1114449) (← links)
- Finding paths and deleting edges in directed acyclic graphs (Q1115184) (← links)
- Variations on the Ising problem (Q1115451) (← links)
- Subtree isomorphism is NC reducible to bipartite perfect matching (Q1115630) (← links)
- On point-linear arboricity of planar graphs (Q1115876) (← links)
- Structural and behavioral equivalence relations in automata networks (Q1116701) (← links)
- The subgraph homeomorphism problem for small wheels (Q1117247) (← links)
- \(P_ 3\)-factorization of complete bipartite graphs (Q1117248) (← links)
