Journal: Journal of Combinatorial Optimization

Found 352 papers in total
A combinatorial proof of the cyclic sieving phenomenon for faces of Coxeterhedra
A combinatorial proof of the cyclic sieving phenomenon for faces of Coxeterhedra
2013,
For a Coxeter system ( W , S ), the subgroup W J generated by a subset J ⊆ S is...
Three conjectures on the signed cycle domination in graphs
Three conjectures on the signed cycle domination in graphs
2013,
Let G =( V , E ) be a graph, a function g : E →{−1,1} is said to be a...
L(p,q)‐labeling of sparse graphs
L(p,q)‐labeling of sparse graphs
2013,
Let p and q be positive integers. An L ( p , q )‐labeling of a graph G with a...
Distance two edge labelings of lattices
Distance two edge labelings of lattices
2013,
Suppose G is a graph. Two edges e and e ′ in G are said to be adjacent if they...
Chromatic number of distance graphs generated by the sets {2,3,x,y}
Chromatic number of distance graphs generated by the sets {2,3,x,y}
2013,
Let D be a set of positive integers. The distance graph generated by D has all...
The hamiltonian numbers in digraphs
The hamiltonian numbers in digraphs
2013,
In the paper, we study the hamiltonian numbers in digraphs. A hamiltonian walk of a...
The game Grundy number of graphs
The game Grundy number of graphs
2013,
Given a graph G =( V , E ), two players, Alice and Bob, alternate their turns in...
Some results on the target set selection problem
Some results on the target set selection problem
2013,
In this paper we consider a fundamental problem in the area of viral marketing, called...
The L(2,1)‐labelling problem for cubic Cayley graphs on dihedral groups
The L(2,1)‐labelling problem for cubic Cayley graphs on dihedral groups
2013,
A k ‐ L (2,1)‐labelling of a graph G is a mapping f : V ( G...
Colorability of mixed hypergraphs and their chromatic inversions
Colorability of mixed hypergraphs and their chromatic inversions
2013,
We solve a long‐standing open problem concerning a discrete mathematical model,...
An extension of Stein‐Lovász theorem and some of its applications
An extension of Stein‐Lovász theorem and some of its applications
2013,
The Stein‐Lovász theorem provides an algorithmic way to deal with the...
The Stackelberg minimum spanning tree game on planar and bounded‐treewidth graphs
The Stackelberg minimum spanning tree game on planar and bounded‐treewidth graphs
2013,
The Stackelberg Minimum Spanning Tree Game is a two‐level combinatorial pricing...
Edge lifting and total domination in graphs
Edge lifting and total domination in graphs
2013,
Let u and v be vertices of a graph G , such that the distance between u and v is two...
A 6/5‐approximation algorithm for the maximum 3‐cover problem
A 6/5‐approximation algorithm for the maximum 3‐cover problem
2013,
In the maximum cover problem, we are given a collection of sets over a ground set of...
Edge‐colouring of joins of regular graphs II
Edge‐colouring of joins of regular graphs II
2013,
We prove that the edges of every even graph G = G 1 + G 2 that is the join of two...
The total domination subdivision number in graphs with no induced 3‐cycle and 5‐cycle
The total domination subdivision number in graphs with no induced 3‐cycle and 5‐cycle
2013,
A set S of vertices of a graph G =( V , E ) without isolated vertex is a total...
Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
2013,
We consider a formulation for the fixed charge network flow (FCNF) problem subject to...
Two‐stage proportionate flexible flow shop to minimize the makespan
Two‐stage proportionate flexible flow shop to minimize the makespan
2013,
We consider a two‐stage flexible flow shop problem with a single machine at one...
A new two‐party bargaining mechanism
A new two‐party bargaining mechanism
2013,
If resources and facilities from different partners need to be engaged for a...
Solving the minimum M‐dominating set problem by a continuous optimization approach based on DC programming and DCA
Solving the minimum M‐dominating set problem by a continuous optimization approach based on DC programming and DCA
2012,
We propose a new optimization approach based on DC (Difference of Convex functions)...
Min‐energy broadcast in mobile ad hoc networks with restricted motion
Min‐energy broadcast in mobile ad hoc networks with restricted motion
2012,
This paper concerns about energy‐efficient broadcasts in mobile ad hoc...
Parity and strong parity edge‐colorings of graphs
Parity and strong parity edge‐colorings of graphs
2012,
A parity walk in an edge‐coloring of a graph is a walk along which each color...
Self‐organizing maps in population based metaheuristic to the dynamic vehicle routing problem
Self‐organizing maps in population based metaheuristic to the dynamic vehicle routing problem
2012,
We consider the dynamic vehicle routing problem (dynamic VRP). In this problem, new...
On the complexity of path problems in properly colored directed graphs
On the complexity of path problems in properly colored directed graphs
2012,
We address the complexity class of several problems related to finding a path in a...
Papers per page: