On the upper chromatic number of \((v_3,b_2)\)-configurations
From MaRDI portal
Publication:1613359
DOI10.1016/S0166-218X(01)00275-XzbMath0999.05031MaRDI QIDQ1613359
Michele Flammini, Claudio Arbib
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
computational complexitypolynomial-time algorithmapproximation algorithmsmixed hypergraphupper chromatic number
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)
Cites Work
This page was built for publication: On the upper chromatic number of \((v_3,b_2)\)-configurations