The χt-coloring problem

DOI10.1007/3-540-59042-0_92zbMATH Open1379.68168OpenAlexW38717466MaRDI QIDQ4596640FDOQ4596640

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

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

Mathematics Subject Classification ID

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

Cited In (10)

• Equitable colorings of bounded treewidth graphs
• Title not available (Why is that?)
• The mutual exclusion scheduling problem for permutation and comparability graphs.
• An approximation scheme for bin packing with conflicts
• Scheduling with conflicts: Online and offline algorithms
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
• The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing
• The 1-Color Problem and the Brylawski Model
• Regular-factors in the complements of partial k-trees
• Title not available (Why is that?)

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)