The following pages link to Parallel concepts in graph theory (Q1324287):
Displaying 50 items.
- t-designs on hypergraphs (Q1239745) (← links)
- Disjoint independent dominating sets in graphs (Q1240740) (← links)
- The dependence graph for bases in matroids (Q1241754) (← links)
- Testing for Equality between Maximum Matching and Minimum Node Covering (Q1242177) (← links)
- Young subgroups and polynomial identities (Q1243358) (← links)
- Nonisomorphic trees with the same T-polynomial (Q1243732) (← links)
- The Min-Max Spanning Tree Problem and some extensions (Q1244239) (← links)
- Minimal graphs with cyclic color group (Q1244249) (← links)
- Characterizing reduced Witt rings of fields (Q1245865) (← links)
- On k-critical, n-connected graphs (Q1245975) (← links)
- Contractions of graphs: A theorem of Ore and an extremal problem (Q1246435) (← links)
- One counterexample for two conjectures on three coloring (Q1246542) (← links)
- A note on finite topologies and switching functions (Q1247947) (← links)
- Distance matrix polynomials of trees (Q1247981) (← links)
- Frequency partitions: Forcibly pancyclic and forcibly nonhamiltonian degree sequences (Q1248529) (← links)
- Uniquely intersectable graphs (Q1248634) (← links)
- Matroids from directed graphs (Q1250104) (← links)
- Hyperbolic trees (Q1250827) (← links)
- On the algebraic structure of rooted trees (Q1251061) (← links)
- A Turan type problem for interval graphs (Q1251233) (← links)
- On separating cycles in graphs (Q1251670) (← links)
- Bounds for the covering number of a graph (Q1252353) (← links)
- Characterizations of 2-variegated graphs and of 3-variegated graphs (Q1252359) (← links)
- Studies on the balancing, the minimal balancing, and the minimum balancing processes for social groups with planar and nonplanar graph structures (Q1252818) (← links)
- On k-minimally n-edge-connected graphs (Q1253668) (← links)
- New bounds for the clique number of a graph (Q1254255) (← links)
- The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two (Q1254855) (← links)
- A new type of combinatorial design (Q1255014) (← links)
- Characterizations of outerplanar graphs (Q1255015) (← links)
- On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs (Q1255017) (← links)
- A test for legitimate decks (Q1255504) (← links)
- Graph isomorphism, general remarks (Q1255944) (← links)
- A unified treatment of nearly reducible and nearly decomposable matrices (Q1256021) (← links)
- Neighbor designs (Q1257019) (← links)
- Counterexamples to the Edge Reconstruction Conjecture for infinite graphs (Q1257028) (← links)
- A critical path generalization of the additive factor method: Analysis of a stroop task (Q1257857) (← links)
- On the cyclomatic number of a hypergraph (Q1257911) (← links)
- The graphs with only self-dual signings (Q1258314) (← links)
- The total coloring of a multigraph with maximal degree 4 (Q1259607) (← links)
- Graph 2-isomorphism is NP-complete (Q1259902) (← links)
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
- Locating an absolute center on graphs that are almost trees (Q1263510) (← links)
- Chromatic partitions of a graph (Q1263595) (← links)
- A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs (Q1263968) (← links)
- Trading independent for synchronized parallelism in finite copying parallel rewriting systems (Q1267708) (← links)
- Extensions of coloring models for scheduling purposes (Q1268282) (← links)
- Cohen-Macaulay rings associated with digraphs (Q1270082) (← links)
- On the relations between arboricity and independent number or covering number (Q1270790) (← links)
- K-center and K-median problems in graded distances (Q1274996) (← links)
- Periodicities on trees (Q1275075) (← links)
