A solution to a colouring problem of P. Erdős

Authors:
Herbert Fleischner;Michael Stiebitz
Affiliations:
-;-
Venue:
Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
Year:
1992

Complexity of graph partition problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Bipartizing matchings and Sabidussi's compatibility conjecture

Discrete Mathematics - Algebraic and topological methods in graph theory
Combinatorial Nullstellensatz

Combinatorics, Probability and Computing
On the Strong Chromatic Number

Combinatorics, Probability and Computing
On the strong chromatic number of random graphs

Combinatorics, Probability and Computing
On two generalizations of the Alon-Tarsi polynomial method

Journal of Combinatorial Theory Series B

Hi-index	0.00