scientific article; zbMATH DE number 3906522

zbMATH Open0568.05027MaRDI QIDQ3684142FDOQ3684142

Authors: Rafel López-Bracho 

Publication date: 1984

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

NP-complete problempath decompositionachromatic number

Mathematics Subject Classification ID

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

Cited In (5)

• Concerning the achromatic number of graphs
• Title not available (Why is that?)
• Achromatic number of fragmentable graphs
• Title not available (Why is that?)
• Decomposition of a complete graph into trails of given lengths

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)