The following pages link to Parallel concepts in graph theory (Q1324287):
Displaying 50 items.
- Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups) (Q1118045) (← links)
- All Ramsey numbers for five vertices and seven or eight edges (Q1119943) (← links)
- Edge-coloured complete graphs: Connectedness of some subgraphs (Q1120587) (← links)
- Reconstructing ancestral character states under Wagner parsimony (Q1121196) (← links)
- Triad count statistics (Q1121915) (← links)
- The relationship between the Jacobi and the successive overrelaxation (SOR) matrices of a k-cyclic matrix (Q1122936) (← links)
- Relational decomposition and structural analysis of systems (Q1123026) (← links)
- Centering a spanning tree of a biconnected graph (Q1123632) (← links)
- The binding number of Halin graphs (Q1123910) (← links)
- On End-regular graphs (Q1126182) (← links)
- On the bondage number of a graph (Q1126221) (← links)
- The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests (Q1132898) (← links)
- Voronoi diagrams from convex hulls (Q1135110) (← links)
- Lower bounds on the cardinality of the maximum matchings of planar graphs (Q1135291) (← links)
- The number of open chains of length three and the parity of the number of open chains of length k in self-complementary graphs (Q1135293) (← links)
- On the existence of uncountably many matroidal families (Q1136773) (← links)
- The subgraph homeomorphism problem (Q1137871) (← links)
- On the inverse M-matrix problem for (0,1)-matrices (Q1139608) (← links)
- Generalized Ramsey theory for graphs, X: Double stars (Q1139609) (← links)
- An interconnection of local maps inducing onto global maps (Q1139933) (← links)
- Digraphs with real and Gaussian spectra (Q1140093) (← links)
- On a variation of the Oberwolfach problem (Q1140095) (← links)
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits (Q1140426) (← links)
- The node-deletion problem for hereditary properties is NP-complete (Q1140988) (← links)
- On finding minimal length superstrings (Q1140992) (← links)
- The relative neighbourhood graph of a finite planar set (Q1141155) (← links)
- A combinatorial optimization problem: optimal generalized cycle bases (Q1141461) (← links)
- Center sets and ternary codes (Q1141622) (← links)
- Edge orientations on cubic graphs with a maximum number of pairs of oppositely oriented edges (Q1142221) (← links)
- On the number of Hamiltonian cycles in tournaments (Q1142228) (← links)
- Ramsey numbers for matchings (Q1143415) (← links)
- On n-extendable graphs (Q1143417) (← links)
- Proving phylogenetic trees minimal with l-clustering and set partitioning (Q1144514) (← links)
- On the complexity of computing bilinear forms with \(\{0,1\}\) constants (Q1144927) (← links)
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs (Q1144938) (← links)
- The smallest graphs with certain adjacency properties (Q1145705) (← links)
- Edge cosymmetric graphs (Q1146195) (← links)
- A note on path-perfect graphs (Q1146196) (← links)
- Contraction theorems in Hamiltonian graph theory (Q1146694) (← links)
- Matrices of zeros and ones with fixed row and column sum vectors (Q1146695) (← links)
- On the complexity of testing a graph for n-cube (Q1146982) (← links)
- Geography, games and graphs (Q1147625) (← links)
- On the coverings of graphs (Q1147719) (← links)
- Comparison of phylogenetic trees (Q1148241) (← links)
- How well can a graph be n-colored? (Q1148324) (← links)
- Paths in r-partite self-complementary graphs (Q1148330) (← links)
- r-partite self-complementary graphs-diameters (Q1148331) (← links)
- Graph theoretic models (Q1148340) (← links)
- Dual imbeddings and wrapped quasi-coverings of graphs (Q1148914) (← links)
- Realization of certain generalized paths in tournaments (Q1148916) (← links)
