Graph Colorings
From MaRDI portal
Publication:4831459
DOI10.1090/CONM/352zbMATH Open1064.05061OpenAlexW4242287981MaRDI QIDQ4831459FDOQ4831459
Author name not available (Why is that?)
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
Recommendations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15)
Cited In (67)
- Equitable coloring of some convex polytope graphs
- Assembly of finite element methods on graphics processors
- A polyhedral approach for the equitable coloring problem
- On certain parameters of equitable coloring of graphs
- An exact algorithm for the maximum probabilistic clique problem
- A note on δ^(k)-colouring of the Cartesian product of some graphs
- A class of weakly perfect graphs
- A probing method for computing the diagonal of a matrix inverse
- On certain coloring parameters of Mycielski graphs of some graphs
- An upper bound for the 3-tone chromatic number of graphs with maximum degree 3
- Interval cyclic edge-colorings of graphs
- The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class
- Title not available (Why is that?)
- Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem
- A note on upper bounds for the maximum span in interval edge-colorings of graphs
- Consecutive colouring of oriented graphs
- A branch and price algorithm for list coloring problem
- Solving Graph Partitioning Problems with Parallel Metaheuristics
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- On zero-error codes produced by greedy algorithms
- Equitable total coloring of complete $r$-partite $p$-balanced graphs
- Circular coloring of graphs via linear programming and tabu search
- A memetic algorithm for the minimum sum coloring problem
- Cyclic deficiency of graphs
- Equitable coloring planar graphs with large girth
- A generalization of interval edge-colorings of graphs
- An improved hybrid ant-local search algorithm for the partition graph coloring problem
- A note on maximum differential coloring of planar graphs
- On some \(L(2, 1)\)-coloring parameters of certain graph classes
- Chromatic graph theory
- Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
- The complexity of restricted star colouring
- A Tabu Search Heuristic for the Equitable Coloring Problem
- Coloring of a non-zero component graph associated with a finite dimensional vector space
- Title not available (Why is that?)
- On equitable coloring of central graphs and total graphs
- MPI+X: task-based parallelisation and dynamic load balance of finite element assembly
- On equitable coloring of corona of wheels
- Minimum order of graphs with given coloring parameters
- On \(J\)-colorability of certain derived graph classes
- New potential functions for greedy independence and coloring
- Polyhedral results for the equitable coloring problem
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- Further results on the deficiency of graphs
- Rainbow neighbourhood number of graphs
- On chromatic Zagreb indices of certain graphs
- A column generation based algorithm for the robust graph coloring problem
- Interval edge-colorings of composition of graphs
- Forbidden structures for planar perfect consecutively colourable graphs
- Equitable coloring parameters of certain graph classes
- The variational quantum eigensolver: a review of methods and best practices
- Advice complexity of maximum independent set in sparse and bipartite graphs
- On equitable colouring of Knödel graphs
- Hybrid evolutionary algorithm for the b-chromatic number
- Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods
- Solving the list coloring problem through a branch-and-price algorithm
- Interval colourable orientations of graphs
- A survey on the Intersection graphs of ideals of rings
- On \(\delta^{(k)}\)-colouring of some wheel related graphs
- Chromatic Zagreb and irregularity polynomials of graphs
- Complexity and online algorithms for minimum skyline coloring of intervals
- On interval colouring reorientation number of oriented graphs
- On δ(k)-coloring of generalized Petersen graphs
- Title not available (Why is that?)
- On δ(k)-coloring of powers of helm and closed helm graphs
- On Co-completek–partite Graph Valued Functions
This page was built for publication: Graph Colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4831459)
