• Daneshyari
  • Topics
    • Physical Sciences and Engineering
      Life Sciences
      Health Sciences
      Social Sciences and Humanities
Daneshyari Discrete Mathematics and Combinatorics Journas Latest Articles

Discrete Mathematics and Combinatorics Research Articles

Some results on Reed’s Conjecture about ω,Δω,Δ, and χχ with respect to αα
Fulltext Access 10 Pages 2010
Visibility in crowds of translates of a centrally symmetric convex body
Fulltext Access 10 Pages 2010
Reversing a polyhedral surface by origami-deformation
Fulltext Access 10 Pages 2010
A conjecture of Welsh revisited
Fulltext Access 10 Pages 2010
On topological relaxations of chromatic conjectures
Fulltext Access 10 Pages 2010
Shilla distance-regular graphs
Fulltext Access 10 Pages 2010
Fulleroids with dihedral symmetry
Fulltext Access 10 Pages 2010
Toughness threshold for the existence of 2-walks in K4K4-minor-free graphs
Fulltext Access 10 Pages 2010
Posets, homomorphisms and homogeneity
Fulltext Access 10 Pages 2010
Sums and differences along Hamiltonian cycles
Fulltext Access 10 Pages 2010
Hall number for list colorings of graphs: Extremal results
Fulltext Access 10 Pages 2010
Anticoloring and separation of graphs
Fulltext Access 10 Pages 2010
Hypergroups and nn-ary relations
Fulltext Access 10 Pages 2010
Representing the sporadic Archimedean polyhedra as abstract polytopes
Fulltext Access 10 Pages 2010
Rose window graphs underlying rotary maps
Fulltext Access 10 Pages 2010
Products of unit distance graphs
Fulltext Access 10 Pages 2010
[r,s,t][r,s,t]-coloring of trees and bipartite graphs
Fulltext Access 10 Pages 2010
Dominating sets in plane triangulations
Fulltext Access 10 Pages 2010
Knights, spies, games and ballot sequences
Fulltext Access 10 Pages 2010
The carving-width of generalized hypercubes
Fulltext Access 10 Pages 2010
Flattening single-vertex origami: The non-expansive case
Fulltext Access 10 Pages 2010
The thickness and chromatic number of rr-inflated graphs
Fulltext Access 10 Pages 2010
The complexity of colouring by locally semicomplete digraphs
Fulltext Access 10 Pages 2010
A geometric non-existence proof of an extremal additive code
Fulltext Access 10 Pages 2010
Oriented diameter of graphs with diameter 3
Fulltext Access 10 Pages 2010
Irreducible triangulations are small
Fulltext Access 10 Pages 2010
A lower bound for the number of orientable triangular embeddings of some complete graphs
Fulltext Access 10 Pages 2010
Packing paths in complete graphs
Fulltext Access 10 Pages 2010
The average order of a subtree of a tree
Fulltext Access 10 Pages 2010
Weak hypergraph regularity and linear hypergraphs
Fulltext Access 10 Pages 2010
Packing non-zero A-paths in an undirected model of group labeled graphs
Fulltext Access 10 Pages 2010
Representations of cyclic groups acting on complete simplicial fans
Fulltext Access 10 Pages 2010
On the number of abstract regular polytopes whose automorphism group is a Suzuki simple group Sz(q)
Fulltext Access 10 Pages 2010
Paley partial difference sets in groups of order n4 and 9n4 for any odd n>1
Fulltext Access 10 Pages 2010
Rank numbers of grid graphs
Fulltext Access 10 Pages 2010
A construction of designs on n+1 points from multiply homogeneous permutation groups of degree n
Fulltext Access 10 Pages 2010
On preserving full orientability of graphs
Fulltext Access 10 Pages 2010
Minimum degree and density of binary sequences
Fulltext Access 10 Pages 2010
On the limitations of the use of solvable groups in Cayley graph cage constructions
Fulltext Access 10 Pages 2010
An infinite family of half-arc-transitive graphs with universal reachability relation
Fulltext Access 10 Pages 2010
On some d  -dimensional dual hyperovals in PG(d(d+3)/2,2)PG(d(d+3)/2,2)
Fulltext Access 10 Pages 2010
Explicit expressions for the extremal excedance set statistics
Fulltext Access 10 Pages 2010
On a problem of Erdős on integers, none of which divides the product of kk others
Fulltext Access 10 Pages 2010
On graphs isomorphic to their neighbour and non-neighbour sets
Fulltext Access 10 Pages 2010
Regressive functions on pairs
Fulltext Access 10 Pages 2010
The lattice of embedded subsets
Fulltext Access 10 Pages 2010
Torsion formulas for signed graphs
Fulltext Access 10 Pages 2010
Random walks and the effective resistance sum rules
Fulltext Access 10 Pages 2010
On orthogonal ray graphs
Fulltext Access 10 Pages 2010
Variance of the subgraph count for sparse Erdős–Rényi graphs
Fulltext Access 10 Pages 2010
Out-arc pancyclicity of vertices in tournaments
Fulltext Access 10 Pages 2010
The Transitive Minimum Manhattan Subnetwork Problem in 3 dimensions
Fulltext Access 10 Pages 2010
Directed defective asymmetric graph coloring games
Fulltext Access 10 Pages 2010
Satisfiability of algebraic circuits over sets of natural numbers
Fulltext Access 10 Pages 2010
Integer matrices with constraints on leading partial row and column sums
Fulltext Access 10 Pages 2010
The tt-discrepancy of a poset
Fulltext Access 10 Pages 2010
‘Strong’–‘weak’ precedence in scheduling: Extensions to series–parallel orders
Fulltext Access 10 Pages 2010
Exact values of ex(ν;{C3,C4,…,Cn})ex(ν;{C3,C4,…,Cn})
Fulltext Access 10 Pages 2010
Forcing matching numbers of fullerene graphs
Fulltext Access 10 Pages 2010
An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order
Fulltext Access 10 Pages 2010
On end-vertices of Lexicographic Breadth First Searches
Fulltext Access 10 Pages 2010
Repetition-free longest common subsequence
Fulltext Access 10 Pages 2010
The kk-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation
Fulltext Access 10 Pages 2010
Further results on atom-bond connectivity index of trees
Fulltext Access 10 Pages 2010
Metric and ultrametric spaces of resistances
Fulltext Access 10 Pages 2010
Which generalized Randić indices are suitable measures of molecular branching?
Fulltext Access 10 Pages 2010
Solving symmetric mixed-model multi-level just-in-time scheduling problems
Fulltext Access 10 Pages 2010
The rank-width of the square grid
Fulltext Access 10 Pages 2010
Characterizing and computing minimal cograph completions
Fulltext Access 10 Pages 2010
A new characterization of P6P6-free graphs
Fulltext Access 10 Pages 2010
Mixed volume techniques for embeddings of Laman graphs
Fulltext Access 10 Pages 2010
Approximating the volume of unions and intersections of high-dimensional geometric objects
Fulltext Access 10 Pages 2010
Covering a simple polygon by monotone directions
Fulltext Access 10 Pages 2010
The genus fields of Artin–Schreier extensions
Fulltext Access 10 Pages 2010
Partial duality and Bollobás and Riordan’s ribbon graph polynomial
Fulltext Access 10 Pages 2010
Fractional set systems with few disjoint pairs
Fulltext Access 10 Pages 2010
Polychromatic colorings of arbitrary rectangular partitions
Fulltext Access 10 Pages 2010
On the existence of maximum resolvable (K4−e)(K4−e)-packings
Fulltext Access 10 Pages 2010
A new class of transitive graphs
Fulltext Access 10 Pages 2010
Scattering matrices of regular coverings of graphs
Fulltext Access 10 Pages 2010
Vertex-transitive self-complementary uniform hypergraphs of prime order
Fulltext Access 10 Pages 2010
Revisiting Gauss's analogue of the prime number theorem for polynomials over a finite field
Fulltext Access 10 Pages 2010
Generalized parking functions, descent numbers, and chain polytopes of ribbon posets
Fulltext Access 10 Pages 2010
Cyclotomy and its application to duadic codes
Fulltext Access 10 Pages 2010
Generating series for irreducible polynomials over finite fields
Fulltext Access 10 Pages 2010
Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality
Fulltext Access 11 Pages 2010
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
Fulltext Access 11 Pages 2010
What is on his mind?
Fulltext Access 11 Pages 2010
On Seymour’s strengthening of Hadwiger’s conjecture for graphs with certain forbidden subgraphs
Fulltext Access 11 Pages 2010
Asymptotic connectivity of hyperbolic planar graphs
Fulltext Access 11 Pages 2010
Unavoidable topological minors of infinite graphs
Fulltext Access 11 Pages 2010
Maximally resonant polygonal systems
Fulltext Access 11 Pages 2010
An upper bound on the paired-domination number in terms of the number of edges in the graph
Fulltext Access 11 Pages 2010
On the Laplacian spectral radius of weighted trees with a positive weight set
Fulltext Access 11 Pages 2010
Constructions of new families of nonbinary CSS codes
Fulltext Access 11 Pages 2010
The triangle intersection numbers of a pair of disjoint S(2,4,v)S(2,4,v)s
Fulltext Access 11 Pages 2010
Edge critical cops and robber
Fulltext Access 11 Pages 2010
Average distance and generalised packing in graphs
Fulltext Access 11 Pages 2010
Cycle factors in strongly connected local tournaments
Fulltext Access 11 Pages 2010
The number of irreducible polynomials of degree nn over FqFq with given trace and constant terms
Fulltext Access 11 Pages 2010
<< < 135 136 137 138 139 > >>
Related Topics
Simulated annealing Articles
1787 Papers
Linear programming Articles
1748 Papers
Algorithm Articles
1719 Papers
Graph theory Articles
1382 Papers
Combinatorial optimization Articles
1214 Papers
Fourier transform Articles
1050 Papers
Markov chain Articles
957 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
Computational Geometry Journal
Discrete Applied Mathematics Journal
Electronic Notes in Theoretical Computer Science Journal
Journal of Discrete Algorithms Journal
Surveys in Operations Research and Management Science Journal
Discrete Optimization Journal
Operations Research Letters Journal
Finite Fields and Their Applications Journal
Advances in Applied Mathematics Journal
AKCE International Journal of Graphs and Combinatorics Journal
Discrete Mathematics Journal
Electronic Notes in 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