A polyhedral study of the acyclic coloring problem (Q5916097): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.03.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127906323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring with no 2-colored \(P_4\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic list 7‐coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colouring of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic Colourings of Planar Graphs with Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4180377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of sparse hessian matrices and graph coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum feedback vertex set and acyclic coloring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic and \(k\)-distance coloring of the grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic coloring of graphs of maximum degree five: nine colors are enough / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4813178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Color Is Your Jacobian? Graph Coloring for Computing Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Acyclic and Star Coloring Algorithms with Application to Computing Hessians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3621531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acyclic chromatic number of Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of products of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric shortest path algorithms with an application to cyclic staffing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle-based facets of chromatic scheduling polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acyclic choosability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 5-choosability of planar graphs without small cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles / rank
 
Normal rank

Latest revision as of 22:39, 5 July 2024

scientific article; zbMATH DE number 6109907
Language Label Description Also known as
English
A polyhedral study of the acyclic coloring problem
scientific article; zbMATH DE number 6109907

    Statements

    A polyhedral study of the acyclic coloring problem (English)
    0 references
    0 references
    0 references
    0 references
    22 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    polyhedral combinatorics
    0 references
    acyclic coloring
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references