Upper bounds on the average number of colors in the non-equivalent colorings of a graph

Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez and Pierre Hauweele

Technical Report (2021)

An external link is available for this item

Department:	Department of Mathematics and Industrial Engineering
Research Center:	GERAD - Research Group in Decision Analysis
PolyPublie URL:	https://publications.polymtl.ca/64266/
Report number:	G-2021-28
Official URL:	https://www.gerad.ca/fr/papers/G-2021-28
Date Deposited:	27 Mar 2025 15:58
Last Modified:	27 Mar 2025 15:58

Cite in APA 7:	Hertz, A., Mélot, H., Bonte, S., Devillez, G., & Hauweele, P. (2021). Upper bounds on the average number of colors in the non-equivalent colorings of a graph. (Technical Report n° G-2021-28). https://www.gerad.ca/fr/papers/G-2021-28
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Repository Staff Only