The χt-coloring problem

DOI10.1007/3-540-59042-0_92MaRDI QIDQ4596640zbMATH OpenOpenAlexFDO

Authors D. Kaller, Arvind Kumar Gupta, T. Shermer

Publication date 4 December 2017

Published in STACS 95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59042-0_92

Mathematics Subject Classification ID

Logic in computer science (03B70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The \(a\)-graph coloring problem
• Publication:4863459
• scientific article; zbMATH DE number 1433954
• \(T\)-colorings of graphs
• scientific article; zbMATH DE number 3308988
• Tverberg's theorem and graph coloring
• scientific article; zbMATH DE number 1792623
• scientific article; zbMATH DE number 773170
• Parameterized coloring problems on chordal graphs
• Parameterized and Exact Computation

Cited in

(11)

• The mutual exclusion scheduling problem for permutation and comparability graphs.
• The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing
• The 1-Color Problem and the Brylawski Model
• scientific article; zbMATH DE number 1433954 (Why is no real title available?)
• An approximation scheme for bin packing with conflicts
• Regular-factors in the complements of partial k-trees
• scientific article; zbMATH DE number 5064034 (Why is no real title available?)
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
• Concurrency constrained scheduling with tree-like constraints
• Equitable colorings of bounded treewidth graphs
• Scheduling with conflicts: Online and offline algorithms

This page was built for publication: The χt-coloring problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596640)