The following pages link to Parallel concepts in graph theory (Q1324287):
Displaying 50 items.
- Parallel concepts in graph theory (Q1324287) (← links)
- Geometric classification of triangulations and their enumeration in a convex polygon (Q1324413) (← links)
- Optimal data exchange algorithms on star graphs (Q1324416) (← links)
- Acyclic edge-colorings of sparse graphs (Q1324448) (← links)
- A pumping lemma and the structure of derivations in the boundary NLC graph languages (Q1328510) (← links)
- A depth-first search routing algorithm for star graphs and its performance evaluation (Q1328866) (← links)
- Hard-to-color graphs for connected sequential colorings (Q1329800) (← links)
- Data structures for two-edge connectivity in planar graphs (Q1331953) (← links)
- The binding numbers of some Cartesian products of graphs (Q1331992) (← links)
- The generating polynomial and Euler characteristic of intersection graphs (Q1332411) (← links)
- About triangles in a graph and its complement (Q1332419) (← links)
- Good and semi-strong colorings of oriented planar graphs (Q1334637) (← links)
- Obstruction set isolation for the gate matrix layout problem (Q1336625) (← links)
- Combinatorial algorithms on a class of graphs (Q1336626) (← links)
- Some properties of contractible transformations on graphs (Q1336692) (← links)
- The generating power of boundary NLC graph grammars and cycle graphs (Q1338850) (← links)
- Determining finite graphs by their large Whitney levels (Q1341414) (← links)
- The existence of infinitely many primary trees (Q1343258) (← links)
- \(T\)-chromatic polynomials (Q1343268) (← links)
- A homology theory for colored graphs (Q1343779) (← links)
- Graph perturbations (Q1344336) (← links)
- The gracefulness of a class of lobster trees (Q1344643) (← links)
- Constant-time parallel recognition of split graphs (Q1349719) (← links)
- Parallel algorithms for connectivity problems on interval graphs (Q1350233) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
- On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks (Q1351611) (← links)
- The center of an infinite graph (Q1356406) (← links)
- The structure of quasi 4-connected graphs (Q1356425) (← links)
- On indexable graphs (Q1356431) (← links)
- Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes (Q1356432) (← links)
- Star-factorization of symmetric complete bipartite digraphs (Q1356498) (← links)
- Long cycles and long paths in the Kronecker product of a cycle and a tree (Q1356512) (← links)
- Chromatic uniqueness in a family of 2-connected graphs (Q1356689) (← links)
- Intersection properties of line graphs (Q1356691) (← links)
- On colored designs. I (Q1356692) (← links)
- Totally equimatchable graphs (Q1356717) (← links)
- Cyclic and cliquewise connectedness of line graphs (Q1363680) (← links)
- Binary vectors partially determined by linear equation systems (Q1363682) (← links)
- New results about the bondage number of a graph (Q1363706) (← links)
- Stage-graph representations (Q1363763) (← links)
- Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection (Q1365183) (← links)
- A calculus of stochastic systems for the specification, simulation, and hidden state estimation of mixed stochastic/nonstochastic systems (Q1365673) (← links)
- Some problems on chromatic polynomials (Q1366774) (← links)
- Chromatic polynomials with least coefficients (Q1366784) (← links)
- Planar graphs with least chromatic coefficients (Q1366785) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- An approval-voting polytope for linear orders (Q1368384) (← links)
- Dynamic graph models (Q1368531) (← links)
- Cycles and cocycles of fuzzy graphs (Q1369168) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
