The χt-coloring problem
From MaRDI portal
Publication:4596640
DOI10.1007/3-540-59042-0_92zbMath1379.68168OpenAlexW38717466MaRDI QIDQ4596640
Arvind Kumar Gupta, T. Shermer, D. Kaller
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
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Scheduling with conflicts: Online and offline algorithms ⋮ Regular-factors in the complements of partial k-trees ⋮ The mutual exclusion scheduling problem for permutation and comparability graphs. ⋮ Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem ⋮ An approximation scheme for bin packing with conflicts ⋮ Equitable colorings of bounded treewidth graphs
This page was built for publication: The χt-coloring problem
