Graph Colorings
From MaRDI portal
Publication:4831459
DOI10.1090/conm/352zbMath1064.05061OpenAlexW4242287981MaRDI QIDQ4831459
No author found.
Publication date: 3 January 2005
Published in: Contemporary Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/conm/352
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15)
Related Items (62)
Further results on the deficiency of graphs ⋮ MPI+X: task-based parallelisation and dynamic load balance of finite element assembly ⋮ Coloring of a non-zero component graph associated with a finite dimensional vector space ⋮ Hybrid evolutionary search for the minimum sum coloring problem of graphs ⋮ Interval cyclic edge-colorings of graphs ⋮ The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class ⋮ A branch and price algorithm for list coloring problem ⋮ Circular coloring of graphs via linear programming and tabu search ⋮ Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On δ(k)-coloring of generalized Petersen graphs ⋮ On δ(k)-coloring of powers of helm and closed helm graphs ⋮ On certain coloring parameters of Mycielski graphs of some graphs ⋮ Equitable coloring parameters of certain graph classes ⋮ A memetic algorithm for the minimum sum coloring problem ⋮ On Co-completek–partite Graph Valued Functions ⋮ The complexity of restricted star colouring ⋮ A Tabu Search Heuristic for the Equitable Coloring Problem ⋮ On equitable colouring of Knödel graphs ⋮ A generalization of interval edge-colorings of graphs ⋮ On \(J\)-colorability of certain derived graph classes ⋮ On some \(L(2, 1)\)-coloring parameters of certain graph classes ⋮ Equitable total coloring of complete $r$-partite $p$-balanced graphs ⋮ An upper bound for the 3-tone chromatic number of graphs with maximum degree 3 ⋮ An exact algorithm for the maximum probabilistic clique problem ⋮ A note on upper bounds for the maximum span in interval edge-colorings of graphs ⋮ Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods ⋮ On chromatic Zagreb indices of certain graphs ⋮ Solving Graph Partitioning Problems with Parallel Metaheuristics ⋮ On certain parameters of equitable coloring of graphs ⋮ A polyhedral approach for the equitable coloring problem ⋮ A note on maximum differential coloring of planar graphs ⋮ Rainbow neighbourhood number of graphs ⋮ Minimum order of graphs with given coloring parameters ⋮ A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives ⋮ Consecutive colouring of oriented graphs ⋮ Equitable coloring planar graphs with large girth ⋮ A column generation based algorithm for the robust graph coloring problem ⋮ Interval edge-colorings of composition of graphs ⋮ Assembly of finite element methods on graphics processors ⋮ A survey on the Intersection graphs of ideals of rings ⋮ A note on δ^(k)-colouring of the Cartesian product of some graphs ⋮ Forbidden structures for planar perfect consecutively colourable graphs ⋮ Hybrid evolutionary algorithm for the b-chromatic number ⋮ New potential functions for greedy independence and coloring ⋮ A probing method for computing the diagonal of a matrix inverse ⋮ Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem ⋮ Cyclic deficiency of graphs ⋮ Complexity and online algorithms for minimum skyline coloring of intervals ⋮ Equitable coloring of some convex polytope graphs ⋮ A class of weakly perfect graphs ⋮ Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions ⋮ An improved hybrid ant-local search algorithm for the partition graph coloring problem ⋮ Unnamed Item ⋮ On Equitable Coloring of Central Graphs and Total Graphs ⋮ Polyhedral results for the Equitable Coloring Problem ⋮ On zero-error codes produced by greedy algorithms ⋮ The variational quantum eigensolver: a review of methods and best practices ⋮ On equitable coloring of corona of wheels ⋮ Advice complexity of maximum independent set in sparse and bipartite graphs ⋮ Chromatic Zagreb and irregularity polynomials of graphs
This page was built for publication: Graph Colorings
