The following pages link to Parallel concepts in graph theory (Q1324287):
Displaying 50 items.
- Probabilistic inference in multiply connected belief networks using loop cutsets (Q911806) (← links)
- A note on locating a central vertex of a 3-cactus graph (Q913638) (← links)
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms (Q913822) (← links)
- Primitivity is hereditary for 2-structures (Q913824) (← links)
- Some bounds for the regular genus of PL-manifolds (Q914194) (← links)
- Hamiltonicity of tree-like graphs (Q914698) (← links)
- Finding Hamiltonian cycles in certain planar graphs (Q916416) (← links)
- On two dual classes of planar graphs (Q916681) (← links)
- Coloring certain proximity graphs (Q917569) (← links)
- Region distributions of graph embeddings and Stirling numbers (Q919004) (← links)
- Graph theoretic characterization and reliability of the multiple-clique network (Q919011) (← links)
- Number synthesis of kinematic chains based on permutation groups (Q923085) (← links)
- The chromaticity of wheels with a missing spoke (Q923093) (← links)
- Tournament scoring problem (Q924403) (← links)
- Approximation algorithms for partially covering with edges (Q930925) (← links)
- Formula dissection: A parallel algorithm for constraint satisfaction (Q931750) (← links)
- Solving the car sequencing problem via branch \& bound (Q932220) (← links)
- Friendship decompositions of graphs (Q932609) (← links)
- The linear 3-arboricity of \(K_{n,n}\) and \(K_n\) (Q932632) (← links)
- A multiplicative inequality for vertex Folkman numbers (Q941354) (← links)
- Q-integral graphs with edge-degrees at most five (Q942092) (← links)
- Shellable graphs and sequentially Cohen-Macaulay bipartite graphs (Q942170) (← links)
- On cyclic edge-connectivity of fullerenes (Q944718) (← links)
- Graph parameters measuring neighbourhoods in graphs-bounds and applications (Q944739) (← links)
- Information processing in complex networks: Graph entropy and information functionals (Q945216) (← links)
- A distance approximating trees (Q948693) (← links)
- Using classical graph theory to generate non-isomorphic floorplan distributions in the measurement of egress complexity (Q949511) (← links)
- Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs (Q949579) (← links)
- A matrix method for computing Szeged and vertex PI indices of join and composition of graphs (Q952061) (← links)
- A note on the pure Morse complex of a graph (Q952613) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- Graphs associated to co-maximal ideals of commutative rings (Q958062) (← links)
- Co-maximal graph of non-commutative rings (Q959866) (← links)
- Ring graphs and complete intersection toric ideals (Q960950) (← links)
- Inequalities for entropy-based measures of network information content (Q961624) (← links)
- On the spectral radius of unicyclic graphs with prescribed degree sequence (Q962120) (← links)
- 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class (Q963062) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- A short constructive proof of the Erdős-Gallai characterization of graphic lists (Q965964) (← links)
- On wreathed lexicographic products of graphs (Q965985) (← links)
- An efficient approach for counting the number of spanning trees in circulant and related graphs (Q966019) (← links)
- Additive edge labelings (Q968162) (← links)
- A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges (Q968184) (← links)
- On disjoint matchings in cubic graphs (Q968438) (← links)
- Trees with minimal index and diameter at most four (Q973144) (← links)
- Products of unit distance graphs (Q973156) (← links)
- An algorithm for partitioning trees augmented with sibling edges (Q975430) (← links)
- Some digraphs arising from number theory and remarks on the zero-divisor graph of the ring \(Z_n\) (Q975437) (← links)
- Global and robust formation-shape stabilization of relative sensing networks (Q976211) (← links)
- Which digraphs with ring structure are essentially cyclic? (Q984026) (← links)
