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

Article (2016)

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/37469/
Journal Title:	Discrete Applied Mathematics (vol. 234)
Publisher:	Elsevier
DOI:	10.1016/j.dam.2016.06.025
Official URL:	https://doi.org/10.1016/j.dam.2016.06.025
Date Deposited:	18 Apr 2023 15:05
Last Modified:	28 Apr 2025 15:37

Cite in APA 7:	Absil, R., Camby, E., Hertz, A., & Mélot, H. (2016). A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n - 3. Discrete Applied Mathematics, 234, 3-11. https://doi.org/10.1016/j.dam.2016.06.025
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