A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n-3

Romain Absil, Eglantine Camby, Alain Hertz and Hadrien Mélot

Technical Report (2015)

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/64022/
Report number:	G-2015-04
Official URL:	https://www.gerad.ca/fr/papers/G-2015-04
Date Deposited:	28 Apr 2025 15:37
Last Modified:	28 Apr 2025 15:37

Cite in APA 7:	Absil, R., Camby, E., Hertz, A., & Mélot, H. (2015). A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n-3. (Technical Report n° G-2015-04). https://www.gerad.ca/fr/papers/G-2015-04
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