The following pages link to Parallel concepts in graph theory (Q1324287):
Displaying 50 items.
- Cycle embedding of augmented cubes (Q990439) (← links)
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation (Q990618) (← links)
- On edge-disjoint pairs of matchings (Q998470) (← links)
- Wiener index of graphs with more than one cut-vertex (Q998596) (← links)
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications (Q1003574) (← links)
- Integer version of the multipath flow network synthesis problem (Q1003728) (← links)
- Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs (Q1007617) (← links)
- Dynamics and stability of volume-scavenging drop arrays: Coarsening by capillarity (Q1011564) (← links)
- Characterization of a class of graphs related to pairs of disjoint matchings (Q1011703) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- A graph-theoretic perspective on the links-to-concepts ratio expected in cognitive maps (Q1015012) (← links)
- Investigating the existence and the regularity of logarithmic Harary graphs (Q1019190) (← links)
- Set colorings of graphs (Q1024295) (← links)
- Szeged index of \(TUC_4C_8(S)\) nanotubes (Q1024312) (← links)
- On self-clique graphs with given clique sizes. II (Q1024466) (← links)
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs (Q1025922) (← links)
- Undirected simple connected graphs with minimum number of spanning trees (Q1025924) (← links)
- Intersection models of weakly chordal graphs (Q1026105) (← links)
- The upper connected geodetic number and forcing connected geodetic number of a graph (Q1028129) (← links)
- A generalization of Lucas polynomial sequence (Q1028417) (← links)
- Minimum cuts, girth and a spectral threshold (Q1029057) (← links)
- Simplicial powers of graphs (Q1040586) (← links)
- Maximum induced subgraph of a recursive circulant (Q1041770) (← links)
- A classification of cubic \(s\)-regular graphs of order \(14p\) (Q1043619) (← links)
- On the hamiltonicity of the Cartesian product (Q1044703) (← links)
- Strongly indexable graphs and applications (Q1045012) (← links)
- Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- Uniformly optimal graphs in some classes of graphs with node failures (Q1045157) (← links)
- Minimum neighborhood in a generalized cube (Q1045906) (← links)
- Global-stability problem for coupled systems of differential equations on networks (Q1046474) (← links)
- Unique eccentric point graphs (Q1050352) (← links)
- Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences (Q1050376) (← links)
- Cobordant crystallizations (Q1050378) (← links)
- Characterizations of strongly chordal graphs (Q1051004) (← links)
- On qualitatively independent partitions and related problems (Q1051639) (← links)
- Size Ramsey numbers involving stars (Q1053710) (← links)
- Recursive descent parsing using implementation languages requiring definition before use (Q1054481) (← links)
- The number of rounds needed to exchange information within a graph (Q1054746) (← links)
- Dynamic cycle detection (Q1055194) (← links)
- On powers and centers of chordal graphs (Q1055453) (← links)
- An algebraic theory of graph factorization (Q1055454) (← links)
- Solutions of some further graph equations (Q1055789) (← links)
- The 1-factorization of some line-graphs (Q1056762) (← links)
- Efficient bounds for the stable set, vertex cover and set packing problems (Q1056763) (← links)
- Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups (Q1057285) (← links)
- On the use of senders in generalized Ramsey theory for graphs (Q1057876) (← links)
- Some properties of a multidigraph by semi-incidence matrices (Q1058523) (← links)
- The minimal trivalent graphs with given smallest odd cycle (Q1058528) (← links)
- A note on the complexity of finding regular subgraphs (Q1059641) (← links)
