The following pages link to Parallel concepts in graph theory (Q1324287):
Displaying 50 items.
- The existence of homeomorphic subgraphs in chordal graphs (Q1372257) (← links)
- The e-mail gossip number and the connected domination number (Q1372291) (← links)
- Uniformly one-connected matrices and their inverses (Q1375096) (← links)
- On properties of unit interval graphs with a perceptual motivation (Q1377473) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- Asymptotic behaviour of the observability of \(Q_ n\) (Q1377684) (← links)
- Multiplicativity of acyclic digraphs (Q1377696) (← links)
- On the characterization of graphs with maximum number of spanning trees (Q1377718) (← links)
- Adjacency of vertices of the complete pre-order polytope (Q1377754) (← links)
- The color cost of a caterpillar (Q1377806) (← links)
- On two new classes of semibiplanes (Q1377808) (← links)
- A-optimal connected block designs with nearly minimal number of observations (Q1378810) (← links)
- The integral closure of subrings associated to graphs (Q1379074) (← links)
- Antipodal covers of strongly regular graphs (Q1379836) (← links)
- Integral sum graphs from identification (Q1381849) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) (← links)
- Finding optimal subgraphs by local search (Q1392027) (← links)
- Embedding ladders and caterpillars into the hypercube (Q1392524) (← links)
- Indecomposable triple systems (Q1393245) (← links)
- Inequalities for the chromatic numbers of graphs (Q1393405) (← links)
- The Ramsey numbers r(P\(_m\),K\(_n\)) (Q1394238) (← links)
- Hypohamiltonian and hypotraceable graphs (Q1394359) (← links)
- Pushing blocks is hard. (Q1395573) (← links)
- Weak-order extensions of an order. (Q1401400) (← links)
- Minimum 3-geodetically connected graphs (Q1406024) (← links)
- On the minimum local-vertex-connectivity augmentation in graphs (Q1406041) (← links)
- Characterization of optimal key set protocols (Q1408828) (← links)
- A graph theoretical determination of solvable complete rigid Lie algebras. (Q1410710) (← links)
- Loops, reflection structures and graphs with parallelism. (Q1411430) (← links)
- Risk transportation via a clique number problem formulation. (Q1412758) (← links)
- Solving a vehicle routing problem by balancing the vehicles time utilization. (Q1412763) (← links)
- Matrix completion problems for pairs of related classes of matrices. (Q1414126) (← links)
- Graphs with only caterpillars as spanning trees (Q1415546) (← links)
- Algebraic properties of location problems with one circular barrier. (Q1420408) (← links)
- Extremal connected graphs for independent domination number (Q1420609) (← links)
- A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree. (Q1423266) (← links)
- Barycentric sequences and barycentric Ramsey numbers for stars. (Q1426109) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- Minimum restricted diameter spanning trees. (Q1427810) (← links)
- Uncertainty measure on fuzzy partitions. (Q1430881) (← links)
- On extendibility of voltage and current regimes from subnetworks (Q1582070) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- Boolean connection algebras: A new approach to the Region-Connection Calculus (Q1583514) (← links)
- Bounding the bandwidths for graphs (Q1583541) (← links)
- Proof of a conjecture in domination theory (Q1584213) (← links)
- Some families of chromatically unique bipartite graphs (Q1584227) (← links)
- Characterisation of potentially generalised bipartite self-complementary bi-graphic sequences (Q1584267) (← links)
- Packing graphs in their complements (Q1584285) (← links)
- Characterisation of self-complementary chordal graphs (Q1584340) (← links)
