Journal: Discrete Applied Mathematics

Found 533 papers in total
Diameters of cubic graphs
Diameters of cubic graphs
1992,
For any pair of natural numbers and d , -graph is a graph with maximum degree at most...
Generalized vertex covering in interval graphs
Generalized vertex covering in interval graphs
1992,
Given an integer i and an undirected graph G , the generalized i -vertex cover problem...
Transmitting in the n-dimensional cube
Transmitting in the n-dimensional cube
1992,
Motivated by a certain communication problem the paper shows that for any integer n...
Random walks with absorbing points
Random walks with absorbing points
1992,
This paper considers paths from (0,0) to (2n,2n ) whose steps are (1,0), (0,1) and...
Structural properties of matroid matchings
Structural properties of matroid matchings
1992,
This paper refines Lovasz’s duality theory for the linear matroid parity problem...
Narrowness, pathwidth, and their application in natural language processing
Narrowness, pathwidth, and their application in natural language processing
1992,
In the syntactic theory of Tesnière the structural description of sentences are...
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
1992,
An edge coloring model is presented for a preemptive open shop problem. Constraints...
Modelling and solving an acyclic multi-period timetabling problem
Modelling and solving an acyclic multi-period timetabling problem
1992,
In this article a special case of the class-teacher timetabling problem is described....
Construction of university faculty timetables using logic programming techniques
Construction of university faculty timetables using logic programming techniques
1992,
A Prolog rule system for timetable construction in university faculties is proposed....
Exchanges procedures for timetabling problems
Exchanges procedures for timetabling problems
1992,
Timetabling problems apper in several practical applications, and they can be...
Finding a feasible course schedule using Tabu search
Finding a feasible course schedule using Tabu search
1992,
The paper considers a course scheduling problem in which the total number of time...
Computerised decision aid for timetabling-A case analysis
Computerised decision aid for timetabling-A case analysis
1992,
Timetabling is a large and complex problem. In the absence of a precise objecive...
The maximum number of winning 2-sets
The maximum number of winning 2-sets
1991,
The winning t-set problem is the problem of choosing nonnegative real numbers ,...
Optimal strategies for some team games
Optimal strategies for some team games
1992,
Consider a game between teams A and B, consisting of a sequence of matches, where each...
Combinatorial aspects of construction of competition in the Dutch Professional Football Leagues
Combinatorial aspects of construction of competition in the Dutch Professional Football Leagues
1992,
Competitions are defined as a set of meetings between a number of clubs at preset...
Generating permutations with given ups and downs
Generating permutations with given ups and downs
1992,
A permutation with a signature Q=(q 1 ,q 2 ,...,q n Å- 1 ) where q i is either 1...
A matching algorithm for regular bipartite graphs
A matching algorithm for regular bipartite graphs
1992,
A timetabling algorithm of Csima is extended to a class of algorithms. It is shown...
Alternating Hamiltonian circuits in edge-coloured bipartite graphs
Alternating Hamiltonian circuits in edge-coloured bipartite graphs
1992,
The paper shows that if G=K n Å, n is edge-coloured with r≥2 colours so that...
On a class of completable partial edge-colourings
On a class of completable partial edge-colourings
1992,
The paper exhibits a large class of completable partial edge-colourings with a...
New clique and independent set algorithms for circle graphs
New clique and independent set algorithms for circle graphs
1992,
Given the interval model of an n- vertex, e- edge circle graph G, it is shown how to...
An optimal algorithm for finding dominating cycles in circular-arc graphs
An optimal algorithm for finding dominating cycles in circular-arc graphs
1992,
A subset D of the vertices of a graph is a dominating cycle if (i) every vertex not in...
Some results concerning the complexity of restricted colorings of graphs
Some results concerning the complexity of restricted colorings of graphs
1992,
The paper considers the complexity of restricted colorings of a graph in which each...
Stability number and chromatic number of tolerance graphs
Stability number and chromatic number of tolerance graphs
1992,
Golumbic and Monma introduced a subclass of perfect graphs called tolerance graphs. In...
Generalized hexagonal systems with each hexagon being resonant
Generalized hexagonal systems with each hexagon being resonant
1992,
An edge of a generalized hexagonal system H is said to be not fixed if it belongs to...
Papers per page: