"The complexity of consecutive D-coloring of bipartite graphs: 4 is easy, 5 ..."

Krzysztof Giaro (1997)

Details and statistics

DOI:

access: unavailable

type: Journal Article

metadata version: 2004-01-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics