The following pages link to Parallel concepts in graph theory (Q1324287):
Displaying 50 items.
- A short solution of Heawood's empire problem in the plane (Q1584437) (← links)
- Spanning trees on hypercubic lattices and nonorientable surfaces (Q1586302) (← links)
- Semi-dynamic breadth-first search in digraphs (Q1589436) (← links)
- The number of edges in a subgraph of a Hamming graph (Q1600356) (← links)
- Optimal gray-code labeling and recognition algorithms for hypercubes (Q1602516) (← links)
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- A new graph characteristic and its application to numerical computability (Q1603419) (← links)
- Graph-theoretic procedures for dimension identification (Q1604619) (← links)
- An efficient algorithm for solving the homogeneous set sandwich problem (Q1607076) (← links)
- The shuffle-cubes and their generalization (Q1607079) (← links)
- An algorithm for prescribed multiple domination in arbitrary graphs (Q1608446) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees (Q1636844) (← links)
- On the number of rainbow spanning trees in edge-colored complete graphs (Q1637154) (← links)
- The second generalized Hamming weight of some evaluation codes arising from a projective torus (Q1637212) (← links)
- A note on co-maximal graphs of commutative rings (Q1643922) (← links)
- Phase transitions in stochastic non-linear threshold Boolean automata networks on \(\mathbb{Z}^2\): the boundary impact (Q1647941) (← links)
- Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← links)
- The bivariate quadratic \(C^1\) spline spaces with stable dimensions on the triangulations (Q1675402) (← links)
- Systematic evaluation of a new combinatorial curvature for complex networks (Q1676814) (← links)
- On total directed graphs of non-commutative rings (Q1680881) (← links)
- Higher order assortativity in complex networks (Q1683104) (← links)
- A Krasnosel'skii-type theorem for an enlarged class of orthogonal polytopes (Q1707420) (← links)
- Twin subgraphs and core-semiperiphery-periphery structures (Q1722674) (← links)
- On line graphs with maximum energy (Q1743069) (← links)
- Light paths and edges in families of outer-1-planar graphs (Q1751428) (← links)
- Distance-hereditary comparability graphs (Q1759843) (← links)
- The crossing number of \(C(n; \{1,3\})\) (Q1763340) (← links)
- A note: Some results in step domination of trees (Q1763346) (← links)
- A modular approach to Sprouts (Q1765239) (← links)
- Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs (Q1765415) (← links)
- On the (numerical) ranking associated with any finite binary relation (Q1765564) (← links)
- Locally twisted cubes are 4-pancyclic. (Q1767147) (← links)
- Identity orientation of complete bipartite graphs (Q1772415) (← links)
- Ramsey numbers of stars versus wheels of similar sizes (Q1773362) (← links)
- On the complexity of the embedding problem for hypercube related graphs (Q1801670) (← links)
- Derangements on the \(n\)-cube (Q1801689) (← links)
- Transfer flow graphs (Q1801698) (← links)
- Generalizations of independence and chromatic numbers of a graph (Q1801703) (← links)
- The number of spanning trees of the generalized hypercube network (Q1802487) (← links)
- Graphs with most number of three point induced connected subgraphs (Q1804874) (← links)
- Conditional chromatic numbers with forbidden cycles (Q1805306) (← links)
- Changing and unchanging of the radius of a graph (Q1805308) (← links)
- Chromatic numbers of competition graphs (Q1805322) (← links)
- Short encodings of planar graphs and maps (Q1805444) (← links)
- A generalization of hypercubes: Complemented graphs (Q1808497) (← links)
- A note on the total chromatic number of Halin graphs with maximum degree 4 (Q1808604) (← links)
- On \(F\)-geodetic graphs (Q1813987) (← links)
- On (1, 2)-realizable graphs (Q1815308) (← links)
