Recommendations
- On structural parameterizations of star coloring
- scientific article; zbMATH DE number 2044931
- scientific article; zbMATH DE number 7527896
- Star coloring of certain graph classes
- Star coloring of graphs
- Star coloring of subcubic graphs
- Star coloring of cubic graphs
- On \(n\)-stars in colorings and orientations of graphs
- Star coloring under some graph operations
- The complexity of restricted star colouring
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Characterization of Block-Graphs
- A branch-and-cut algorithm for graph coloring
- A generalization of antiwebs to independence systems and their canonical facets
- Acyclic and star colorings of cographs
- Acyclic colorings of planar graphs
- Branch-cut-and-propagate for the maximum \(k\)-colorable subgraph problem with symmetry
- Coloring with no 2-colored \(P_4\)'s
- Distance-hereditary graphs
- Efficient computation of sparse hessians using coloring and automatic differentiation
- Estimation of sparse hessian matrices and graph coloring problems
- Facet of regular 0–1 polytopes
- Facets of the graph coloring polytope
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On certain polytopes associated with graphs
- On the facial structure of set packing polyhedra
- Packing and partitioning orbitopes
- SCIP: solving constraint integer programs
- Star coloring of graphs
- The maximum k-colorable subgraph problem and orbitopes
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- polymake: a framework for analyzing convex polytopes
Cited in
(7)- The maximum k-colorable subgraph problem and orbitopes
- Block colourings of star systems
- A polyhedral study of the maximum stable set problem with weights on vertex-subsets
- Vertex coloring without large polychromatic stars
- scientific article; zbMATH DE number 6124450 (Why is no real title available?)
- A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs
- Packing, partitioning, and covering symresacks
This page was built for publication: A polyhedral investigation of star colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284838)
