Font Size: a A A
Keyword [Distinguishing]
Result: 141 - 160 | Page: 8 of 9
141. (Adjacent) Vertex Distinguition Coloring Problem Research Of Special Graphs
142. Several Results On Vertex-distinguishing E-total Colorings Of Complete Bipartite Graph K10,n
143. Vertex Distinguishing IE-total Coloring And General-total Coloring Of K2,n,p(2?n?5,n?p)
144. Adjacent Vertex Distinguishing Edge Coloring Of Planar Graphs
145. The Neighbor-distinguishing Edge Chromatic Number And Total Chromatic Number Of Graphs
146. The Neighbor Expanded Sum Distinguishing Total Colorings Of Some Special Graphs
147. Next-generation Quantum Theory Of Atoms In Molecules (QTAIM) For Bond Broken And Distinguishing Molecular Isotopomers
148. Research On Quantum Secret Sharing Scheme And Distinguishing Method Based On Local Distinction
149. A Climatology and Synoptic-Dynamic Basis for Distinguishing Cool-Season Precipitation Events at St. John's, Newfoundland
150. Distinguishing homogeneous and heterogeneous origins of nonexponential dynamics using multiple population period transient spectroscopy
151. Distinguishing signal from noise: New techniques for gravitational wave data analysi
152. Histomolecular characterization of human hydatidiform moles: Distinguishing complete moles from partial moles
153. Undecidability of the problem of distinguishing K-theory classes of the reduced group C*-algebra for a finitely presented group
154. Distinguishing between modes of dispersal by introduced eastern grey squirrels (Sciurus carolinensis)
155. Three problems in graph labeling
156. Distinguishing between the geomorphic and hydrometeorological controls recorded in clastic varved sediments
157. An analysis of the complexity of geomorphic phenomena
158. Distinguishing natural from cultural salmonid deposits in Pacific Northwest North America
159. Chaos and Time Series Analysis: Optimization of the Poincare Section And Distinguishing Between Deterministic and Stochastic Time Serie
160. Spanning Structures In Randomly Perturbed Hypergraphs And Graph Coloring Problems
  <<First  <Prev  Next>  Last>>  Jump to