Feasible edge colorings of trees with cardinality constraints

Authors:
D. de Werra;A. Hertz;D. Kobler;N. V. R. Mahadev
Affiliations:
-;-;-;-
Venue:
Discrete Mathematics
Year:
2000

Citing 0
Cited 3

Edge dominating set and colorings on graphs with fixed clique-width

Discrete Applied Mathematics
Minimum entropy coloring

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Graph coloring with cardinality constraints on the neighborhoods

Discrete Optimization

Quantified Score

Hi-index	0.05

Visualization

Abstract