On the pseudo-achromatic number problem

DOI10.1016/j.tcs.2008.11.010zbMath1162.68022OpenAlexW1979866923MaRDI QIDQ1006054

Jie Meng, Iyad A. Kanj, Fenghui Zhang, Ge Xia, Jian'er Chen

Publication date: 17 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://via.library.depaul.edu/tr/2

zbMATH Keywords

kernelfixed-parameter tractabilityparameterized complexitypseudo-achromatic number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Harmonious coloring: parameterized algorithms and upper bounds ⋮ Harmonious Coloring: Parameterized Algorithms and Upper Bounds ⋮ On the Pseudo-achromatic Number Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong computational lower bounds via parameterized complexity
• Partition graphs and coloring numbers of a graph
• The complexity of harmonious colouring for trees
• The pseudoachromatic number of a graph
• Achromatic number is NP-complete for cographs and interval graphs
• On the pseudoachromatic number of a graph
• On the pseudoachromatic number of join of graphs

This page was built for publication: On the pseudo-achromatic number problem