Counting the number of non-equivalent vertex colorings of a graph

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/34244/
Journal Title:	Discrete Applied Mathematics (vol. 203)
Publisher:	Elsevier
DOI:	10.1016/j.dam.2015.09.015
Official URL:	https://doi.org/10.1016/j.dam.2015.09.015
Date Deposited:	18 Apr 2023 15:05
Last Modified:	08 Apr 2025 06:55

Cite in APA 7:	Hertz, A., & Mélot, H. (2016). Counting the number of non-equivalent vertex colorings of a graph. Discrete Applied Mathematics, 203, 62-71. https://doi.org/10.1016/j.dam.2015.09.015
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