• 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

(1,1,0)-coloring of planar graphs without cycles of length 4 and 6
Fulltext Access 5 Pages 2013
Counting 2-connected deletion-minors of binary matroids
Fulltext Access 5 Pages 2013
On graphs with an eigenvalue of maximal multiplicity
Fulltext Access 5 Pages 2013
Summation formulae for qq-Watson type 4ϕ34ϕ3-series
Fulltext Access 5 Pages 2013
Non-uniqueness of minimal superpermutations
Fulltext Access 5 Pages 2013
Lifting automorphisms along abelian regular coverings of graphs
Fulltext Access 5 Pages 2013
The Steiner diameter of a graph with prescribed girth
Fulltext Access 5 Pages 2013
On transitive irreducible BLT-sets
Fulltext Access 5 Pages 2013
Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
Fulltext Access 5 Pages 2013
On the existence of uniformly resolvable decompositions of Kv and Kv−I into paths and kites
Fulltext Access 5 Pages 2013
Maximal (n,4)(n,4)-arcs in the projective plane of order 11
Fulltext Access 5 Pages 2013
Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars
Fulltext Access 5 Pages 2013
Eulerian pairs on Fibonacci words
Fulltext Access 5 Pages 2013
Covering a cubic graph with perfect matchings
Fulltext Access 5 Pages 2013
Improved bound on facial parity edge coloring
Fulltext Access 5 Pages 2013
Ovoidal packings of PG(3,q) for even q
Fulltext Access 5 Pages 2013
Estimates on the size of the cycle spectra of Hamiltonian graphs
Fulltext Access 5 Pages 2013
New optimal subsystem codes
Fulltext Access 5 Pages 2013
On the determinant of bipartite graphs
Fulltext Access 5 Pages 2013
Spanning kk-ended trees of bipartite graphs
Fulltext Access 5 Pages 2013
The inverse problem on subset sums
Fulltext Access 5 Pages 2013
Decomposing a graph into bistars
Fulltext Access 5 Pages 2013
Characterizing graphic matroids by a system of linear equations
Fulltext Access 5 Pages 2013
More on Moore graphs
Fulltext Access 5 Pages 2013
A short proof for Chenʼs Alternative Kneser Coloring Lemma
Fulltext Access 5 Pages 2013
Proof of a positivity conjecture on Schur functions
Fulltext Access 5 Pages 2013
On coloring points with respect to rectangles
Fulltext Access 5 Pages 2013
Improved bounds for Erdősʼ Matching Conjecture
Fulltext Access 5 Pages 2013
Essential positive covers of the cube
Fulltext Access 5 Pages 2013
Distinct distances on two lines
Fulltext Access 5 Pages 2013
A number of stable matchings in models of the Gale–Shapley type
Fulltext Access 5 Pages 2013
Proof of Moll's minimum conjecture
Fulltext Access 5 Pages 2013
Many large eigenvalues in sparse graphs
Fulltext Access 5 Pages 2013
The real-rootedness and log-concavities of coordinator polynomials of Weyl group lattices
Fulltext Access 5 Pages 2013
On the ratio of maximum and minimum degree in maximal intersecting families
Fulltext Access 5 Pages 2013
Efficient domination in circulant graphs
Fulltext Access 5 Pages 2013
Conditions for families of disjoint kk-connected subgraphs in a graph
Fulltext Access 5 Pages 2013
A sharp upper bound for the rainbow 2-connection number of a 2-connected graph
Fulltext Access 5 Pages 2013
Automorphisms of infinite Johnson graphs
Fulltext Access 5 Pages 2013
On the set of circular total chromatic numbers of graphs
Fulltext Access 5 Pages 2013
Finding the edge ranking number through vertex partitions
Fulltext Access 5 Pages 2013
A short proof of the versatile version of Fleischner's theorem
Fulltext Access 5 Pages 2013
Parameterized complexity of k-Chinese Postman Problem
Fulltext Access 5 Pages 2013
Inapproximability results for the minimum integral solution problem with preprocessing over ℓ∞ norm
Fulltext Access 5 Pages 2013
Anti-magic labelling of Cartesian product of graphs
Fulltext Access 5 Pages 2013
Preface
Fulltext Access 5 Pages 2013
On the Randić index and girth of graphs
Fulltext Access 5 Pages 2013
Prescribed edges and forbidden edges for a cycle in a planar graph
Fulltext Access 5 Pages 2013
Bounding the size of the subgraph induced by mm vertices and extra edge-connectivity of hypercubes
Fulltext Access 5 Pages 2013
On the harmonic index and the chromatic number of a graph
Fulltext Access 5 Pages 2013
On a conjecture of the Randić index and the minimum degree of graphs
Fulltext Access 5 Pages 2013
bb-chromatic numbers of powers of paths and cycles
Fulltext Access 5 Pages 2013
Bicyclic graphs with maximal revised Szeged index
Fulltext Access 5 Pages 2013
On the skewness of the join of graphs
Fulltext Access 5 Pages 2013
A note on periodic schedules for linear precedence constraints
Fulltext Access 5 Pages 2013
An odd kind of BCH code
Fulltext Access 5 Pages 2013
Permutation polynomials and their differential properties over residue class rings
Fulltext Access 5 Pages 2013
The minimum size of k-rainbow connected graphs of given order
Fulltext Access 5 Pages 2013
A note on the upper bound and girth pair of (k;g)(k;g)-cages
Fulltext Access 5 Pages 2013
Achromatic number of collections of paths and cycles
Fulltext Access 5 Pages 2013
The energy of q-Kneser graphs and attenuated q-Kneser graphs
Fulltext Access 5 Pages 2013
Hamiltonicity of large generalized de Bruijn cycles
Fulltext Access 5 Pages 2013
Restricted arc-connectivity in tournaments
Fulltext Access 5 Pages 2013
Injectivity and weak ternary separation
Fulltext Access 5 Pages 2013
Connectivity of Kronecker products with complete multipartite graphs
Fulltext Access 5 Pages 2013
Log-concavity and unimodality of compound polynomials
Fulltext Access 5 Pages 2013
Covering a chessboard with staircase walks
Fulltext Access 5 Pages 2013
The Erdős–Sós conjecture for spiders of large size
Fulltext Access 5 Pages 2013
Editorial Board
Fulltext Access 6 Pages 2013
The maximum number of minimal codewords in an [n,k]-code
Fulltext Access 6 Pages 2013
Editorial Board
Fulltext Access 6 Pages 2013
A note on perfect partial elimination
Fulltext Access 6 Pages 2013
Editorial Board
Fulltext Access 6 Pages 2013
Anti-Ramsey number of matchings in hypergraphs
Fulltext Access 6 Pages 2013
Rainbow edge-coloring and rainbow domination
Fulltext Access 6 Pages 2013
Distant irregularity strength of graphs
Fulltext Access 6 Pages 2013
Balanced degree-magic complements of bipartite graphs
Fulltext Access 6 Pages 2013
An analogue of the Erdős-Ko-Rado theorem for weak compositions
Fulltext Access 6 Pages 2013
Dominating functions and total dominating functions of countable graphs
Fulltext Access 6 Pages 2013
Circuit extension and circuit double cover of graphs
Fulltext Access 6 Pages 2013
Hypergraphic submodular function minimization
Fulltext Access 6 Pages 2013
Generalizing Tutte’s theorem and maximal non-matchable graphs
Fulltext Access 6 Pages 2013
On large sets of projective planes of orders 3 and 4
Fulltext Access 6 Pages 2013
Editorial Board
Fulltext Access 6 Pages 2013
Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
Fulltext Access 6 Pages 2013
The acyclic and C⃗3-free disconnection of tournaments
Fulltext Access 6 Pages 2013
Editorial Board
Fulltext Access 6 Pages 2013
Edge-colouring and total-colouring chordless graphs
Fulltext Access 6 Pages 2013
Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
Fulltext Access 6 Pages 2013
Equitable vertex arboricity of graphs
Fulltext Access 6 Pages 2013
Editorial Board
Fulltext Access 6 Pages 2013
Extending Berge’s and Favaron’s results about well-covered graphs
Fulltext Access 6 Pages 2013
Precise location of vertices on Hamiltonian cycles
Fulltext Access 6 Pages 2013
On multisets of hook lengths of partitions
Fulltext Access 6 Pages 2013
Addendum to “Recursively defined metric spaces without contraction” [Theoret. Comput. Sci. 380 (1/2) (2007) 143–163]
Fulltext Access 6 Pages 2013
Recursive construction of non-cyclic pandiagonal Latin squares
Fulltext Access 6 Pages 2013
On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7
Fulltext Access 6 Pages 2013
Editorial Board
Fulltext Access 6 Pages 2013
Editorial Board
Fulltext Access 6 Pages 2013
2D knapsack: Packing squares
Fulltext Access 6 Pages 2013
<< < 80 81 82 83 84 > >>
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