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

Search

The smallest hard-to-color graph for algorithm DSATUR

Abstract

Citations

  • 1 2

    CrossRef

  • 0

    Web of Science

  • 1 0

    Scopus

Authors (5)

  • Photo of  R. Janczewski

    R. Janczewski

  • Photo of  M. Kubale

    M. Kubale

  • Photo of  K. Manuszewski

    K. Manuszewski

  • Photo of  K. Piwakowski

    K. Piwakowski

Cite as

Full text

full text is not available in portal

Details

Category:
Magazine publication
Type:
Magazine publication
Published in:
DISCRETE MATHEMATICS no. 236, edition 1-3, pages 151 - 165,
ISSN: 0012-365X
ISSN:
0012-365X
Publication year:
2001
DOI:
Digital Object Identifier (open in new tab) 10.1016/s0012-365x(00)00439-8
Verified by:
No verification

seen 122 times

Meta Tags