Graph Colorings
From MaRDI portal
Recommendations
Cited in
(84)- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- Equitable coloring of some convex polytope graphs
- Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem
- Cyclic deficiency of graphs
- On zero-error codes produced by greedy algorithms
- The variational quantum eigensolver: a review of methods and best practices
- A branch and price algorithm for list coloring problem
- The complexity of restricted star colouring
- On \(J\)-colorability of certain derived graph classes
- On some \(L(2, 1)\)-coloring parameters of certain graph classes
- Consecutive colouring of oriented graphs
- New potential functions for greedy independence and coloring
- Advice complexity of maximum independent set in sparse and bipartite graphs
- Further results on the deficiency of graphs
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- Equitable total coloring of complete $r$-partite $p$-balanced graphs
- A polyhedral approach for the equitable coloring problem
- Equitable coloring planar graphs with large girth
- 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
- A kaleidoscopic view of graph colorings
- On equitable coloring of central graphs and total graphs
- Polyhedral results for the equitable coloring problem
- On equitable colouring of Knödel graphs
- On chromatic Zagreb indices of certain graphs
- Assembly of finite element methods on graphics processors
- Circular coloring of graphs via linear programming and tabu search
- A class of weakly perfect graphs
- A tabu search heuristic for the equitable coloring problem
- Rainbow neighbourhood number of graphs
- scientific article; zbMATH DE number 7228907 (Why is no real title available?)
- A memetic algorithm for the minimum sum coloring problem
- Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions
- A guide to graph colouring. Algorithms and applications
- Chromatic graph theory
- An exact algorithm for the maximum probabilistic clique problem
- A note on upper bounds for the maximum span in interval edge-colorings of graphs
- On certain coloring parameters of Mycielski graphs of some graphs
- Equitable coloring parameters of certain graph classes
- Solving graph partitioning problems with parallel metaheuristics
- Graph colorings
- A note on maximum differential coloring of planar graphs
- scientific article; zbMATH DE number 867661 (Why is no real title available?)
- Minimum order of graphs with given coloring parameters
- A probing method for computing the diagonal of a matrix inverse.
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
- On equitable coloring of corona of wheels
- Guide to graph colouring. Algorithms and applications
- Chromatic Zagreb and irregularity polynomials of graphs
- MPI+X: task-based parallelisation and dynamic load balance of finite element assembly
- On \(\delta^{(k)}\)-coloring of generalized Petersen graphs
- On \(\delta^{(k)}\)-coloring of powers of helm and closed helm graphs
- On co-complete \(k\)-partite graph valued functions
- Modified chromatic Schultz polynomial of some cycle related graphs
- A column generation based algorithm for the robust graph coloring problem
- Interval edge-colorings of composition of graphs
- scientific article; zbMATH DE number 7141490 (Why is no real title available?)
- Forbidden structures for planar perfect consecutively colourable graphs
- Hybrid evolutionary algorithm for the b-chromatic number
- Coloring of a non-zero component graph associated with a finite dimensional vector space
- On certain parameters of equitable coloring of graphs
- Complexity and online algorithms for minimum skyline coloring of intervals
- A generalization of interval edge-colorings of graphs
- A note on δ^(k)-colouring of the Cartesian product of some graphs
- A survey on the Intersection graphs of ideals of rings
- 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
- On \(\delta^{(k)}\)-colouring of some wheel related graphs
- On interval colouring reorientation number of oriented graphs
- Graph coloring methods
- On deficiency of complete 3-partite and 4-partite graphs
- The equitable non-split domination number of graphs
- Incident vertex pi coloring of middle, total, line and splitting graph for star and double star graph families
- Near-interval edge colorings of graphs
- Hypergraph operations preserving sc-greediness
- Surrogate models for vibrational entropy based on a spatial decomposition
- -boundedness and related problems on graphs without long induced paths: a survey
- The equitable chromatic number of circulant graphs with maximum degree at most 4
- Interval edge-colorings of Cartesian products of graphs. II
- Near-interval edge-colorings of complete bipartite graphs
- Some new results on equitable dominator coloring of graphs
- An improved hybrid ant-local search algorithm for the partition graph coloring problem
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)
