Upper bound on the non-colorability threshold of the 2+p-COL problem

DOI10.1016/J.ENDM.2005.05.004MaRDI QIDQ3439656zbMATH OpenOpenAlexFDO

Authors Roberto Cruz

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.05.004

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: Upper bound on the non-colorability threshold of the 2+p-COL problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439656)