On the hardness of computing maximum self-reduction sequences

DOI10.1016/S0012-365X(00)00132-1zbMath0982.05099OpenAlexW2013505915MaRDI QIDQ1841907

Nicholas Paul Sheppard, Jeffrey H. Kingston

Publication date: 8 April 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00132-1

zbMATH Keywords

reduction sequencesself-reduction

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

This page was built for publication: On the hardness of computing maximum self-reduction sequences