Journal: Journal of Combinatorial Optimization

Found 352 papers in total
Improved upper bound for the degenerate and star chromatic numbers of graphs
Improved upper bound for the degenerate and star chromatic numbers of graphs
2017,
Let G = G ( V , E ) be a graph. A proper coloring of G is a function f : V → N...
Fractional matching preclusion of graphs
Fractional matching preclusion of graphs
2017,
Let F be an edge subset and F ′ a subset of edges and vertices of a graph G . If...
Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
2017,
We study the multi‐agent scheduling on a single machine with a fixed number of...
On the online multi-agent O‐D k-Canadian Traveler Problem
On the online multi-agent O‐D k-Canadian Traveler Problem
2017,
In this article, we present new results on the online multi‐agent O–D k...
Two efficient values of cooperative games with graph structure based on τ-values
Two efficient values of cooperative games with graph structure based on τ-values
2017,
The paper is devoted to value concepts for cooperative games with a communication...
Online scheduling to minimize the total weighted completion time plus the rejection cost
Online scheduling to minimize the total weighted completion time plus the rejection cost
2017,
We consider the online scheduling on a single machine, in which jobs are released over...
On Motzkin‐Straus type results for non-uniform hypergraphs
On Motzkin‐Straus type results for non-uniform hypergraphs
2017,
Recently, some extensions of Motzkin–Straus theorems were proved for...
Triple-solution approach for the strip packing problem with two-staged patterns
Triple-solution approach for the strip packing problem with two-staged patterns
2017,
A triple‐solution approach for the rectangular level strip packing problem is...
Recoverable robust spanning tree problem under interval uncertainty representations
Recoverable robust spanning tree problem under interval uncertainty representations
2017,
This paper deals with the recoverable robust spanning tree problem under interval...
Total edge irregularity strength of accordion graphs
Total edge irregularity strength of accordion graphs
2017,
An edge irregular total k ‐labeling φ : V ∪ E → { 1 , 2 , …...
Distance domination in graphs with given minimum and maximum degree
Distance domination in graphs with given minimum and maximum degree
2017,
For an integer k ≥ 1 , a distance k ‐dominating set of a connected graph G...
On maximum Wiener index of trees and graphs with given radius
On maximum Wiener index of trees and graphs with given radius
2017,
Let G be a connected graph of order n . The long‐standing open and close...
A note on orientation and chromatic number of graphs
A note on orientation and chromatic number of graphs
2017,
Let D be any edge orientation of a graph G . We denote by Δ k ( D ) the maximum...
Independent sets in some classes of Si,j,k-free graphs
Independent sets in some classes of Si,j,k-free graphs
2017,
The maximum weight independent set (MWIS) problem on graphs with vertex weights asks...
Task assignment in tree-like hierarchical structures
Task assignment in tree-like hierarchical structures
2017,
Many large organizations, such as corporations, are hierarchical by nature. In...
Matching and domination numbers in r-uniform hypergraphs
Matching and domination numbers in r-uniform hypergraphs
2017,
A matching is a set of pairwise disjoint hyperedges of a hypergraph H . The matching...
Single-machine scheduling with production and rejection costs to minimize the maximum earliness
Single-machine scheduling with production and rejection costs to minimize the maximum earliness
2017,
In this paper, we consider the single‐machine scheduling problem with...
The Weight Function Lemma for graph pebbling
The Weight Function Lemma for graph pebbling
2017,
Graph pebbling is a network model for studying whether or not a given supply of...
Two-agent scheduling of time-dependent jobs
Two-agent scheduling of time-dependent jobs
2017,
We consider the problem of scheduling deteriorating jobs or shortening jobs with two...
The adjacent vertex distinguishing total chromatic numbers of planar graphs with Δ=10
The adjacent vertex distinguishing total chromatic numbers of planar graphs with Δ=10
2017,
A (proper) total‐ k ‐coloring of a graph G is a mapping ϕ : V ( G )...
A note on (s, t)-relaxed L(2, 1)-labeling of graphs
A note on (s, t)-relaxed L(2, 1)-labeling of graphs
2017,
Let G = ( V , E ) be a graph. For two vertices u and v in G , we denote d G ( u , v )...
Equitable vertex arboricity of 5-degenerate graphs
Equitable vertex arboricity of 5-degenerate graphs
2017,
Wu et al. (Discret Math 313:2696–2701, 2013) conjectured that the vertex set of...
Fibonacci helps to evacuate from a convex region in a grid network
Fibonacci helps to evacuate from a convex region in a grid network
2017,
This study considers an evacuation problem where the evacuees try to escape to the...
On the vertex cover P3 problem parameterized by treewidth
On the vertex cover P3 problem parameterized by treewidth
2017,
Consider a graph G . A subset of vertices, F , is called a vertex cover P t ( V C P t...
Papers per page: