The smallest hard-to-color graph for the SL algorithm - Publication - Bridge of Knowledge

The smallest hard-to-color graph for the SL algorithm

Abstract

Citations

1

CrossRef
0

Web of Science
2

Scopus

Authors (3)

Marek Kubale prof. dr hab. inż.
Jaroslaw Pakulski
Konrad Piwakowski

Cite as

Full text

full text is not available in portal

full content of the article see on external site open in new tab

Details

Category:: Magazine publication
Type:: Magazine publication
Published in:: DISCRETE MATHEMATICS no. 164, edition 1-3, pages 197 - 212,
ISSN: 0012-365X
ISSN:: 0012-365X
Publication year:: 1997
DOI:: Digital Object Identifier (open in new tab) 10.1016/s0012-365x(96)00052-0
Verified by:: No verification

seen 146 times