The following pages link to Parallel concepts in graph theory (Q1324287):
Displaying 50 items.
- Structure of a Morse form foliation on a closed surface in terms of genus (Q549962) (← links)
- Bounds for the signless Laplacian energy (Q550610) (← links)
- Line graph of combinations of generalized Bethe trees: Eigenvalues and energy (Q550615) (← links)
- On products and line graphs of signed graphs, their eigenvalues and energy (Q550619) (← links)
- Line graph eigenvalues and line energy of caterpillars (Q551331) (← links)
- On the skew energy of orientations of hypercubes (Q551340) (← links)
- Relations between adjacency trees (Q554222) (← links)
- Hypergraph polytopes (Q554398) (← links)
- The eccentric connectivity index of nanotubes and nanotori (Q555125) (← links)
- A linear algorithm for the cutting center of a tree (Q578919) (← links)
- The bounded degree problem for NLC grammars is decidable (Q579950) (← links)
- The number of perfect matchings in a hypercube (Q580373) (← links)
- On nonnegative factorization of matrices (Q580478) (← links)
- The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
- Vector representations of graphs (Q584287) (← links)
- Domination alteration sets in graphs (Q585222) (← links)
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- The role of complexity in comparing classifications (Q585631) (← links)
- Binary contraction of graphs (Q594112) (← links)
- Computational complexity of compaction to irreflexive cycles (Q596309) (← links)
- BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet (Q597404) (← links)
- The Zagreb coindices of graph operations (Q602672) (← links)
- Use of the Szeged index and the revised Szeged index for measuring network bipartivity (Q608277) (← links)
- Some extended results on diameter-stable graphs (Q614328) (← links)
- A history of graph entropy measures (Q621629) (← links)
- The disconnection number of a graph (Q624413) (← links)
- The domination numbers of cylindrical grid graphs (Q627140) (← links)
- Improper C-colorings of graphs (Q629357) (← links)
- Measuring distances between complex networks (Q641225) (← links)
- On the Zagreb indices of the line graphs of the subdivision graphs (Q648165) (← links)
- Extremal properties of the bipartite vertex frustration of graphs (Q654182) (← links)
- On upper bounds for parameters related to the construction of special maximum matchings (Q658043) (← links)
- Sampling complete designs (Q658083) (← links)
- 3-consecutive edge coloring of a graph (Q658096) (← links)
- Extended Petersen networks (Q665322) (← links)
- Balance in gain graphs - a spectral analysis (Q665934) (← links)
- Tree 3-spanners on interval, permutation and regular bipartite graphs (Q671393) (← links)
- On some decision problems for trace codings (Q672324) (← links)
- Linear bounds for on-line Steiner problems (Q672394) (← links)
- 1-Approximation algorithm for bottleneck disjoint path matching (Q672495) (← links)
- On the generalized twisted cube (Q672499) (← links)
- Trivalent Cayley graphs for interconnection networks (Q672973) (← links)
- Graph theoretic aspects of maximizing the spectral radius of nonnegative matrices (Q677122) (← links)
- On matrix structures invariant under Toda-like isospectral flows (Q677898) (← links)
- From ternary strings to Wiener indices of benzenoid chains (Q678878) (← links)
- Dynamic algorithms for shortest paths in planar graphs (Q685367) (← links)
- A new variation on hypercubes with smaller diameter (Q685501) (← links)
- Coloring a graph optimally with two colors (Q685594) (← links)
- Maintenance of 2- and 3-edge-connected components of graphs. I (Q685694) (← links)
- Packings and perfect path double covers of maximal planar graphs (Q686163) (← links)
