Three algorithms for graph locally harmonious colouring
From MaRDI portal
Publication:4978237
DOI10.1080/10236198.2015.1124101zbMath1367.05071OpenAlexW2338684177MaRDI QIDQ4978237
No author found.
Publication date: 8 August 2017
Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10236198.2015.1124101
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
On the total edge irregularity strength of general uniform cactus chain graphs with pendant vertices ⋮ On total vertex irregularity strength of generalized uniform cactus chain graphs with pendant vertices ⋮ Modeling of hybrid nanofluid behavior within a permeable media involving buoyancy effect ⋮ Investigation of hybrid nanofluid migration within a porous closed domain
Cites Work
- Harmonious coloring of trees with large maximum degree
- A hierarchy of relaxations for linear generalized disjunctive programming
- Sparse weighted voting classifier selection and its linear programming relaxations
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
- On linear and semidefinite programming relaxations for hypergraph matching
- Relaxations of linear programming problems with first order stochastic dominance constraints
- Surrogate constraint normalization for the set covering problem
- The harmonious coloring number of a graph
- On the capacitated vehicle routing problem
- Harmonious chromatic number of directed graphs
- Zero duality gap in surrogate constraint optimization: a concise review of models
- A branch-and-price algorithm for the robust graph coloring problem
- A branch-and-cut algorithm for graph coloring
- The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes
- Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout
- On the Harmonious Coloring of Graphs
- An upper bound for the harmonious chromatic number of a graph
- A Pruning Procedure for Exact Graph Coloring
- New methods to color the vertices of a graph
- Semidefinite relaxation for linear programs with equilibrium constraints
- Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints
This page was built for publication: Three algorithms for graph locally harmonious colouring
