scientific article; zbMATH DE number 3906522

MaRDI QIDQ3684142zbMATH OpenFDO

Authors Rafel López-Bracho

Publication date 1984

zbMATH Keywords

achromatic numberNP-complete problempath decomposition

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3882457
• The achromatic number of bounded degree trees
• scientific article; zbMATH DE number 1088659
• Efficient approximation algorithms for the achromatic number
• Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi
• A linear time algorithm for edge coloring of binomial trees
• scientific article; zbMATH DE number 1405798
• scientific article; zbMATH DE number 1753164
• On rainbow-cycle-forbidding edge colorings of finite graphs
• scientific article; zbMATH DE number 1824689

Cited in

(5)

• Concerning the achromatic number of graphs
• Decomposition of a complete graph into trails of given lengths
• Achromatic number of fragmentable graphs
• scientific article; zbMATH DE number 3882457 (Why is no real title available?)
• scientific article; zbMATH DE number 817404 (Why is no real title available?)

This page was built for publication:

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