The following pages link to Parallel concepts in graph theory (Q1324287):
Displaying 50 items.
- Orders, reduction graphs and spectra (Q1275630) (← links)
- DNA models and algorithms for NP-complete problems (Q1276167) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (Q1276945) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Knots and graphs. I: Arc graphs and colorings (Q1284502) (← links)
- Symmetrization inequalities for difference equations on graphs (Q1284503) (← links)
- Remarks on the thickness of a graph (Q1292575) (← links)
- Graphical \(t\)-designs via polynomial Kramer-Mesner matrices (Q1292815) (← links)
- On the out-domination and in-domination numbers of a digraph (Q1292825) (← links)
- Clique divergent graphs with unbounded sequence of diameters (Q1292855) (← links)
- On point-set domination in graphs. IV: Separable graphs with unique minimum psd-sets (Q1296965) (← links)
- Cycle-factorization of symmetric complete multipartite digraphs (Q1297459) (← links)
- The realization graph of a degree sequence with majorization gap 1 is Hamiltonian (Q1300907) (← links)
- Chromatic polynomials of homeomorphism classes of graphs (Q1300985) (← links)
- A sublinear bound on the chromatic index of multigraphs (Q1301715) (← links)
- The line index and minimum cut of weighted graphs (Q1303736) (← links)
- The zero-divisor graph of a commutative ring (Q1305005) (← links)
- Locally pancyclic graphs (Q1305522) (← links)
- A self-stabilizing distributed algorithm to find the median of a tree graph (Q1305938) (← links)
- Classes of chromatically unique or equivalent graphs (Q1309443) (← links)
- Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices (Q1309472) (← links)
- Reverse binary graphs (Q1310229) (← links)
- Vulnerability in graphs of diameter four (Q1310232) (← links)
- Hypercubes, shuffle-exchange graphs and de Bruijn digraphs (Q1310233) (← links)
- Abstract sphere-of-influence graphs (Q1310234) (← links)
- The geodetic number of a graph (Q1310238) (← links)
- Quantifying fault recovery in multiprocessor systems (Q1310239) (← links)
- Variations on a hypercube: Embellishments of parallel architectures (Q1310240) (← links)
- Subgraph generating functions in chemistry---an example for perfect matchings on honeycomb fragments (Q1310242) (← links)
- Construction of graphs with special properties (Q1310245) (← links)
- No-hole 2-distant colorings (Q1310246) (← links)
- Finding extremal sets in less than quadratic time (Q1313720) (← links)
- Sum graphs over all the integers (Q1313829) (← links)
- Some determinant expansions and the matrix-tree theorem (Q1313835) (← links)
- Realizing the chromatic numbers of triangulations of surfaces (Q1313860) (← links)
- Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs (Q1313863) (← links)
- A result about the incident edges in the graphs \(M_ k\) (Q1313883) (← links)
- A counterexample to a conjecture on the bondage number of a graph (Q1313887) (← links)
- Transformations of one-dimensional cellular automaton rules by translation-invariant local surjective mappings (Q1315987) (← links)
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
- Enumeration of basic kinematic chains with simple and multiple joints (Q1317948) (← links)
- Properties of grammatical codes of trees (Q1318691) (← links)
- Computational complexity of loss networks (Q1318715) (← links)
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree (Q1318763) (← links)
- Minimal graphs of a torus, a projective plane and spheres and some properties of minimal graphs of homotopy classes (Q1318805) (← links)
- Minors of quasi 4-connected graphs (Q1318814) (← links)
- Minimum degree games for graphs (Q1322180) (← links)
- The square of a chordal graph (Q1322181) (← links)
- A class of clique-closed graphs (Q1322222) (← links)
- On antichain intersection numbers, total clique covers and regular graphs (Q1322237) (← links)
