On the Pseudo-achromatic Number Problem

DOI10.1007/978-3-540-92248-3_8zbMATH Open1202.68209OpenAlexW1630017552MaRDI QIDQ5302045FDOQ5302045

Fenghui Zhang, Ge Xia, Iyad Kanj, Jianer Chen, Jie Meng

Publication date: 20 January 2009

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://via.library.depaul.edu/cgi/viewcontent.cgi?article=1005&context=tr

zbMATH Keywords

kernelfixed-parameter tractabilityparameterized complexitypseudo-achromatic number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to algorithms
• The complexity of harmonious colouring for trees
• The pseudoachromatic number of a graph
• Strong computational lower bounds via parameterized complexity
• Achromatic number is NP-complete for cographs and interval graphs
• On the pseudoachromatic number of a graph
• Complete partitions of graphs
• On the pseudoachromatic number of join of graphs
• Partition graphs and coloring numbers of a graph
• On the pseudo-achromatic number problem

Cited In (1)

• On upper bounds for the pseudo-achromatic index

This page was built for publication: On the Pseudo-achromatic Number Problem

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