Achromatic number of fragmentable graphs

DOI10.1002/jgt.20468zbMath1209.05080DBLPjournals/jgt/Edwards10OpenAlexW4247884217WikidataQ56390764 ScholiaQ56390764MaRDI QIDQ3055929

Keith J. Edwards

Publication date: 10 November 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20468

zbMATH Keywords

achromatic numberdetachmentproper vertex coloringcomplete coloringfragmentable graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Achromatic number of collections of paths and cycles ⋮ Achromatic and Harmonious Colorings of Circulant Graphs ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ Complete colourings of hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concerning the achromatic number of graphs
• The achromatic number of bounded degree trees
• Achromatic number is NP-complete for cographs and interval graphs
• The achromatic number of the union of cycles
• Efficient approximation algorithms for the achromatic number
• On Approximating the Achromatic Number
• Approximation Algorithms for the Achromatic Number
• An Improved Approximation of the Achromatic Number on Bipartite Graphs
• New upper bounds on harmonious colorings
• Detachments of Complete Graphs
• The achromatic number of the union of paths

This page was built for publication: Achromatic number of fragmentable graphs