Three algorithms for graph locally harmonious colouring

DOI10.1080/10236198.2015.1124101MaRDI QIDQ4978237zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

harmonious colouringlocally harmonious colouringspecial independent set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Harmonious colouring of graphs
• Publication:4206748
• On the Harmonious Coloring of Graphs
• Local optimization of colorings of graphs
• The complexity of harmonious colouring for trees

Cites work

• A branch-and-cut algorithm for graph coloring
• A branch-and-price algorithm for the robust graph coloring problem
• A hierarchy of relaxations for linear generalized disjunctive programming
• A Pruning Procedure for Exact Graph Coloring
• An upper bound for the harmonious chromatic number of a graph
• Harmonious chromatic number of directed graphs
• Harmonious coloring of trees with large maximum degree
• Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints
• Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout
• New methods to color the vertices of a graph
• On linear and semidefinite programming relaxations for hypergraph matching
• On the capacitated vehicle routing problem
• On the Harmonious Coloring of Graphs
• On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
• Relaxations of linear programming problems with first order stochastic dominance constraints
• Semidefinite relaxation for linear programs with equilibrium constraints
• Sparse weighted voting classifier selection and its linear programming relaxations
• Surrogate constraint normalization for the set covering problem
• The harmonious coloring number of a graph
• The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes
• Zero duality gap in surrogate constraint optimization: a concise review of models

Cited in

(4)

• Modeling of hybrid nanofluid behavior within a permeable media involving buoyancy effect
• Investigation of hybrid nanofluid migration within a porous closed domain
• 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

This page was built for publication: Three algorithms for graph locally harmonious colouring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978237)