Local Search Improvements for Soft Happy Colouring

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shekarriz, Mohammad Hadi, Thiruvady, Dhananjay, Nazari, Asef, Imrich, Wilfried
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Combinatorics 05C15, 05C80, 05C85
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finding happiness by evolutionary algorithms
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)

Overcoming Tight Constraints in Soft Happy Colouring
by: Shekarriz, Mohammad Hadi, et al.
Published: (2026)

The 2-domination number of cylindrical graphs
by: Martínez, José Antonio, et al.
Published: (2024)

On the structure of (dart, odd hole)-free graphs
by: Hoàng, Chính T.
Published: (2025)

$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
by: Zaker, Manouchehr
Published: (2024)

On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
by: Zaker, Manouchehr
Published: (2024)

More relations between $λ$-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
by: Zaker, Manouchehr
Published: (2021)

Four Dominion Growth Regimes in Trees: Forcing, Fibonacci Enumeration, Periodicity, and Stability
by: Allagan, Julian, et al.
Published: (2026)

Deduction, Constrained Zero Forcing, and Constrained Searching
by: Burgess, Andrea, et al.
Published: (2024)

The strong vertex span of trees
by: Grašič, Mateja, et al.
Published: (2024)

Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs
by: Jaworska, Justyna, et al.
Published: (2025)

The clique chromatic number of sparse random graphs
by: Fernandez V, Manuel, et al.
Published: (2024)

On the concentration of the chromatic number of random graphs
by: Surya, Erlang, et al.
Published: (2022)

Graph Burning: Bounds and Hardness
by: Antony, Dhanyamol, et al.
Published: (2024)

Characterizations of undirected 2-quasi best match graphs
by: Korchmaros, Annachiara, et al.
Published: (2025)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
by: Furmańczyk, Hanna, et al.
Published: (2020)

On 3-Coloring of $(2P_4,C_5)$-Free Graphs
by: Jelínek, Vít, et al.
Published: (2020)

Vertex evaluation of multiplex graphs using Forman Curvature
by: Yamada, Taiki
Published: (2025)

Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
by: Anil, Arun, et al.
Published: (2023)

Fractional list packing for layered graphs
by: Cambie, Stijn, et al.
Published: (2024)

Optimal List Recoloring of Subcubic Graphs and Complete Multipartite Graphs
by: De Meyer, Lucas
Published: (2025)

An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
by: Mkrtchyan, Vahan
Published: (2024)

Computing the permanental polynomial of $4k$-intercyclic bipartite graphs
by: Bapat, Ravindra B., et al.
Published: (2024)

Finding hypergraph immersion is fixed-parameter tractable
by: Meng, Xiangyi, et al.
Published: (2024)

Finding cliques and dense subgraphs using edge queries
by: Csóka, Endre, et al.
Published: (2023)

Hamilton decompositions of the directed 7-torus at odd modulus via root-flat certificates and a prefix-count construction
by: Park, SangHyun
Published: (2026)

On Intersection Graphs of Graphs and Hypergraphs: A Survey
by: Naik, Ranjan N.
Published: (2018)

A new density limit for unanimity in majority dynamics on random graphs
by: Kim, Jeong Han, et al.
Published: (2025)

Infinite families of planar graphs of a given injective chromatic number
by: Daneels, Matias, et al.
Published: (2024)

Cops and Robbers, Clique Covers, and Induced Cycles
by: Clow, Alexander, et al.
Published: (2025)

Minimal $L^p$-congestion spanning trees on weighted graphs
by: Lafuente, Alberto Castejón, et al.
Published: (2025)

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems
by: Grigoriev, Alexander, et al.
Published: (2025)

Soft Barycentric Refinement
by: Knill, Oliver
Published: (2025)

Colourings of $(m, n)$-coloured mixed graphs
by: MacGillivray, Gary, et al.
Published: (2020)

Graphs whose Eulerian trails have unique labels
by: Kim, Donggyu, et al.
Published: (2026)

$K_2$-Hamiltonian Graphs: II
by: Goedgebeur, Jan, et al.
Published: (2023)

Isomorphisms between dense random graphs
by: Surya, Erlang, et al.
Published: (2023)

Functionality of Random Graphs
by: Sylvester, John, et al.
Published: (2024)

Layered tree-independence number and clique-based separators
by: Dallard, Clément, et al.
Published: (2025)

Generation and New Infinite Families of $K_2$-hypohamiltonian Graphs
by: Goedgebeur, Jan, et al.
Published: (2023)