Journal: Discrete Applied Mathematics

Found 533 papers in total
Edge colouring line graphs of unicyclic graphs
Edge colouring line graphs of unicyclic graphs
1992,
The chromatic index problem is known to be NP-complete, even for line graphs. In this...
A binary search problem on graphs
A binary search problem on graphs
1992,
Let G=(V,E) be a graph and &etilde;∈E an unknown edge. In order to find &etilde;...
q-functional equations and some partition identities
q-functional equations and some partition identities
1991,
The paper uses q -functional equations to prove some ( n+t) -color partition...
Generalized flags in finite Abelian p-groups
Generalized flags in finite Abelian p-groups
1991,
For each partition λ of n , let LÅλ=LÅλ(p) be the...
Brick tabloids and the connection matrices between bases of symmetric functions
Brick tabloids and the connection matrices between bases of symmetric functions
1991,
Let H n denote the space of symmetric functions, homogeneous of degree n . This paper...
Some applications of algebra to combinatorics
Some applications of algebra to combinatorics
1991,
This paper is based on lectures and provides a tutorial guide to the use of set theory...
Certain Boolean equations
Certain Boolean equations
1992,
In a previous paper, two theorems are given related to the number of parameters of the...
A greedy reduction algorithm for setup optimization
A greedy reduction algorithm for setup optimization
1992,
A reduction algorithm for setup optimization in general ordered sets is proposed....
Linear sections of the general linear group: A geometric approach
Linear sections of the general linear group: A geometric approach
1992,
This paper investigates the subset •(n,q) of the general linear group Gl(...
Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice
Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice
1991,
Let , , be the number of chains (totally ordered sets) of length i contained in a...
La queste del saint Gra(AL): A computational approach to local algebra
La queste del saint Gra(AL): A computational approach to local algebra
1991,
The paper shows how, by means of the Tangent Cone Algorithm, the basic functions...
On Bayer’s deformation and the associativity formula
On Bayer’s deformation and the associativity formula
1991,
A usual technique in computational commutative algebra is to reduce the computation of...
Constructive complexity
Constructive complexity
1991,
Powerful and widely applicable, yet inherently nonconstructive, tools have recently...
On doing Todd-Coxeter coset enumeration in parallel
On doing Todd-Coxeter coset enumeration in parallel
1991,
The Todd-Coxeter coset enumeration method is without any doubt the best known and most...
Semigroup automaton structure by homomorphism and domain partition
Semigroup automaton structure by homomorphism and domain partition
1991,
The problem of deciding if a given function of the set of states of a finite...
An introduction to randomized algorithms
An introduction to randomized algorithms
1991,
Research conducted over the past fifteen years has amply demonstrated the advantages...
Improved bounds for harmonic-based bin packing algorithms
Improved bounds for harmonic-based bin packing algorithms
1991,
The modified harmonic bin packing algorithm, and Hu and Kahng’s unnamed...
Calculating growth rates and moments for additive cellular automata
Calculating growth rates and moments for additive cellular automata
1992,
Suppose that the cellular automation F is the graph of an additive rule modulo p. It...
Algebraic expressions for Kekulé structure counts of nonbranched cata-condensed benzenoid
Algebraic expressions for Kekulé structure counts of nonbranched cata-condensed benzenoid
1992,
In this paper, for Kekulé structure counts (simply, K number) of nonbranched...
On the tree packing problem
On the tree packing problem
1992,
The maximum tree packing problem asks to pack the greatest possible number of...
Computing independent sets in graphs with large girth
Computing independent sets in graphs with large girth
1992,
It is shown that the well-known independent set problem remains NP-complete even when...
The Mapmaker’s dilemma
The Mapmaker’s dilemma
1991,
The authors examine the problem of coloring a subgraph of a k -colorable graph without...
Computation of the expected number of leaves in a tree having a given automorphism, and related topics
Computation of the expected number of leaves in a tree having a given automorphism, and related topics
1991,
The authors derive explicit formulas for the expected number of leaves in a random...
Threshold functions for local properties of graphs: Triangles
Threshold functions for local properties of graphs: Triangles
1991,
The neighborhood of a vertex in a graph is the subgraph induced by the vertices...
Papers per page: