• Daneshyari
  • Topics
    • Physical Sciences and Engineering
      Life Sciences
      Health Sciences
      Social Sciences and Humanities
Daneshyari Theoretical Computer Science Journas Latest Articles

Theoretical Computer Science Research Articles

The supereulerian graphs in the graph family C(l,k)C(l,k)
Fulltext Access 6 Pages 2009
The NN-queens Problem on a symmetric Toeplitz matrix
Fulltext Access 6 Pages 2009
Maximal planar graphs of inscribable type and diagonal flips
Fulltext Access 6 Pages 2009
Distinguishing labeling of group actions
Fulltext Access 6 Pages 2009
On clone sets of GF(q)-representable matroids
Fulltext Access 6 Pages 2009
Bounding the size of square-free subgraphs of the hypercube
Fulltext Access 6 Pages 2009
On a property of minimal triangulations
Fulltext Access 6 Pages 2009
Greedy TT-colorings of graphs
Fulltext Access 6 Pages 2009
The (a,b)-forcing geodetic graphs
Fulltext Access 6 Pages 2009
Arbitrary decompositions into open and closed trails
Fulltext Access 6 Pages 2009
A criterion for the half-plane property
Fulltext Access 6 Pages 2009
On the monotonicity properties of additive representation functions, II
Fulltext Access 6 Pages 2009
On 2-factors with cycles containing specified edges in a bipartite graph
Fulltext Access 6 Pages 2009
A constructive characterization of total domination vertex critical graphs
Fulltext Access 6 Pages 2009
Trees through specified vertices
Fulltext Access 6 Pages 2009
On the spread of the spectrum of a graph
Fulltext Access 6 Pages 2009
A classification of cubic ss-regular graphs of order 14p14p
Fulltext Access 6 Pages 2009
The edge-Wiener index of a graph
Fulltext Access 6 Pages 2009
CI-property of elementary abelian 3-groups
Fulltext Access 6 Pages 2009
The lollipop graph is determined by its Q-spectrum
Fulltext Access 6 Pages 2009
On minor-minimally 3-connected binary matroids
Fulltext Access 6 Pages 2009
A classification of cubic ss-regular graphs of order 16p16p
Fulltext Access 6 Pages 2009
Graphs of given degree and diameter obtained as abelian lifts of dipoles
Fulltext Access 6 Pages 2009
ββ-degree closures for graphs
Fulltext Access 6 Pages 2009
Minimum broadcast tree decompositions
Fulltext Access 6 Pages 2009
Bounds on the number of maximal sum-free sets
Fulltext Access 6 Pages 2009
The chromatic polynomial and list colorings
Fulltext Access 6 Pages 2009
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
Fulltext Access 6 Pages 2009
An empty interval in the spectrum of small weight codewords in the code from points and k-spaces of PG(n,q)
Fulltext Access 6 Pages 2009
Contents of Volume 116
Fulltext Access 6 Pages 2009
Restricted set addition: The exceptional case of the Erdős–Heilbronn conjecture
Fulltext Access 6 Pages 2009
On averaging Frankl's conjecture for large union-closed-sets
Fulltext Access 6 Pages 2009
The descent statistic on involutions is not log-concave
Fulltext Access 6 Pages 2009
On semicube graphs
Fulltext Access 6 Pages 2009
Commutation relations and Vandermonde determinants
Fulltext Access 6 Pages 2009
List 2-distance (Δ+2)(Δ+2)-coloring of planar graphs with girth six
Fulltext Access 6 Pages 2009
Strongly distance-balanced graphs and graph products
Fulltext Access 6 Pages 2009
The vertex-connectivity of a distance-regular graph
Fulltext Access 6 Pages 2009
On direct product cancellation of graphs
Fulltext Access 6 Pages 2009
Matching graphs of hypercubes and complete bipartite graphs
Fulltext Access 6 Pages 2009
Bipartite Ramsey numbers involving large Kn,nKn,n
Fulltext Access 6 Pages 2009
Addendum to: “Involutions and reflection subgroups of finite Coxeter groups” [European J. Combin.]
Fulltext Access 6 Pages 2009
On the conjectured upper bounds for entries of mutation count matrices
Fulltext Access 6 Pages 2009
Commutativity of the adjacency matrices of graphs
Fulltext Access 6 Pages 2009
On the dimensions of the binary codes of a class of unitals
Fulltext Access 6 Pages 2009
Classification of simple 2-(11,3,3)(11,3,3) designs
Fulltext Access 6 Pages 2009
A realization of graph associahedra
Fulltext Access 6 Pages 2009
Claw-free graphs are not universal fixers
Fulltext Access 6 Pages 2009
On signed cycle domination in graphs
Fulltext Access 6 Pages 2009
Diameter vulnerability of graphs by edge deletion
Fulltext Access 6 Pages 2009
Efficient computation of the iteration of functions
Fulltext Access 6 Pages 2009
On a class of binary linear completely transitive codes with arbitrary covering radius
Fulltext Access 6 Pages 2009
A note on submodular set cover on matroids
Fulltext Access 6 Pages 2009
A dynamic distributed approach to representing proper interval graphs
Fulltext Access 6 Pages 2009
On Vizing’s bound for the chromatic index of a multigraph
Fulltext Access 6 Pages 2009
Maximum uniformly resolvable designs with block sizes 2 and 4
Fulltext Access 6 Pages 2009
An upper bound for the number of independent sets in regular graphs
Fulltext Access 6 Pages 2009
Almost avoiding permutations
Fulltext Access 6 Pages 2009
The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares
Fulltext Access 6 Pages 2009
A Sturmian sequence related to the uniqueness conjecture for Markoff numbers
Fulltext Access 6 Pages 2009
Finding compact structural motifs
Fulltext Access 6 Pages 2009
Editorial Board
Fulltext Access 6 Pages 2009
Editorial Board
Fulltext Access 6 Pages 2009
On Chooser–Picker positional games
Fulltext Access 6 Pages 2009
On the inapproximability of independent domination in 2P3-free perfect graphs
Fulltext Access 6 Pages 2009
Overlap-freeness in infinite partial words
Fulltext Access 6 Pages 2009
Algorithms for connected set cover problem and fault-tolerant connected set cover problem
Fulltext Access 6 Pages 2009
An approximation algorithm to the k-Steiner Forest problem
Fulltext Access 6 Pages 2009
Editorial Board
Fulltext Access 6 Pages 2009
Generalized juntas and NP-hard sets
Fulltext Access 6 Pages 2009
Existential MSO over two successors is strictly weaker than over linear orders
Fulltext Access 6 Pages 2009
A zero-one law for RP and derandomization of AM if NP is not small
Fulltext Access 6 Pages 2009
Z-abstract Basis
Fulltext Access 6 Pages 2009
Dynamic Evaluation Tree for Presenting Expression Evaluations Visually
Fulltext Access 6 Pages 2009
Discretized Fractional Calculus with a Series of Chebyshev Polynomial
Fulltext Access 6 Pages 2009
Trees with the second largest number of maximal independent sets
Fulltext Access 6 Pages 2009
On the ratios between packing and domination parameters of a graph
Fulltext Access 6 Pages 2009
Path transferability of graphs with bounded minimum degree
Fulltext Access 6 Pages 2009
Edge choosability of planar graphs without 5-cycles with a chord
Fulltext Access 6 Pages 2009
On circle graphs with girth at least five
Fulltext Access 6 Pages 2009
Enumerating typical abelian prime-fold coverings of a circulant graph
Fulltext Access 6 Pages 2009
The hull and geodetic numbers of orientations of graphs
Fulltext Access 6 Pages 2009
Dirac-type generalizations concerning large cycles in graphs
Fulltext Access 6 Pages 2009
On graphs whose square have strong hamiltonian properties
Fulltext Access 6 Pages 2009
Stability of the path–path Ramsey number
Fulltext Access 6 Pages 2009
On Beck’s coloring of posets
Fulltext Access 6 Pages 2009
Maximal Sidon sets and matroids
Fulltext Access 6 Pages 2009
Constructing continuum many countable, primitive, unbalanced digraphs
Fulltext Access 6 Pages 2009
An Asymptotic Approach for Testing P0-Matrices
Fulltext Access 6 Pages 2009
Color degree and alternating cycles in edge-colored graphs
Fulltext Access 6 Pages 2009
Cayley digraphs with normal adjacency matrices
Fulltext Access 6 Pages 2009
Complete rr-partite subgraphs of dense rr-graphs
Fulltext Access 6 Pages 2009
Canonical Ramsey numbers and properly colored cycles
Fulltext Access 6 Pages 2009
On the Laplacian spectral radii of trees
Fulltext Access 6 Pages 2009
A note on Berge–Fulkerson coloring
Fulltext Access 6 Pages 2009
Tetravalent ss-transitive graphs of order 4p4p
Fulltext Access 6 Pages 2009
Transitive resolvable idempotent quasigroups and large sets of resolvable Mendelsohn triple systems
Fulltext Access 6 Pages 2009
Set systems with cross LL-intersection and kk-wise LL-intersecting families
Fulltext Access 6 Pages 2009
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
Fulltext Access 6 Pages 2009
Edge-deletable IM-extendable graphs with minimum number of edges
Fulltext Access 6 Pages 2009
<< < 144 145 146 147 148 > >>
Related Topics
Fuzzy logic Articles
2743 Papers
Earthquakes Articles
770 Papers
Information theory Articles
762 Papers
Laplace transform Articles
639 Papers
Algebra and Number Theory Articles
Analysis Articles
Applied Mathematics Articles
Computational Mathematics Articles
Control and Optimization Articles
Discrete Mathematics and Combinatorics Articles
Geometry and Topology Articles
Logic Articles
Mathematical Physics Articles
Mathematics (General) Articles
Modelling and Simulation Articles
Numerical Analysis Articles
Statistics and Probability Articles
Theoretical Computer Science Articles
All Topics
Related Journals
Algebra and Number Theory Journals
Analysis Journals
Applied Mathematics Journals
Computational Mathematics Journals
Control and Optimization Journals
Discrete Mathematics and Combinatorics Journals
Geometry and Topology Journals
Logic Journals
Mathematical Physics Journals
Mathematics (General) Journals
Modelling and Simulation Journals
Numerical Analysis Journals
Statistics and Probability Journals
Theoretical Computer Science Journals
Discrete Applied Mathematics Journal
Electronic Notes in Theoretical Computer Science Journal
Information and Computation Journal
Theoretical Computer Science Journal
Journal of the Nigerian Mathematical Society Journal
AKCE International Journal of Graphs and Combinatorics Journal
Discrete Mathematics Journal
European Journal of Combinatorics Journal
Journal of Combinatorial Theory, Series A Journal
Journal of Combinatorial Theory, Series B Journal

Daneshyari.com

دسترسی سریع

  • صفحه اصلی دانشیاری
  • دسته بندی موضوعی مقالات
  • مقالات ترجمه شده
  • سفارش ترجمه مقاله
  • سفارش تولید محتوا
  • تولید محتوا

ارتباط

  • ورود
  • عضویت
  • تماس و پشتیبانی
  • تبلیغات

English Website

  • Home
  • Physical Sciences and Engineering
  • Life Sciences
  • Health Sciences
  • Social Sciences and Humanities