A polyhedral investigation of star colorings
From MaRDI portal
Publication:284838
DOI10.1016/J.DAM.2016.03.003zbMATH Open1336.05042OpenAlexW2335094801MaRDI QIDQ284838FDOQ284838
Authors: Christopher Hojny, Marc E. Pfetsch 
Publication date: 18 May 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.03.003
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
- polymake: a framework for analyzing convex polytopes
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- SCIP: solving constraint integer programs
- Title not available (Why is that?)
- A generalization of antiwebs to independence systems and their canonical facets
- On certain polytopes associated with graphs
- Facet of regular 0–1 polytopes
- On the facial structure of set packing polyhedra
- Acyclic colorings of planar graphs
- Distance-hereditary graphs
- Facets of the graph coloring polytope
- Coloring with no 2-colored \(P_4\)'s
- A branch-and-cut algorithm for graph coloring
- Efficient computation of sparse hessians using coloring and automatic differentiation
- Branch-cut-and-propagate for the maximum \(k\)-colorable subgraph problem with symmetry
- Star coloring of graphs
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
- Estimation of sparse hessian matrices and graph coloring problems
- A Characterization of Block-Graphs
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- Acyclic and star colorings of cographs
- The maximum \(k\)-colorable subgraph problem and orbitopes
- Packing and partitioning orbitopes
Cited In (7)
- Block colourings of star systems
- The maximum \(k\)-colorable subgraph problem and orbitopes
- A polyhedral study of the maximum stable set problem with weights on vertex-subsets
- Vertex coloring without large polychromatic stars
- Title not available (Why is that?)
- A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs
- Packing, partitioning, and covering symresacks
Uses Software
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)
