Feasible edge colorings of trees with cardinality constraints

DOI10.1016/S0012-365X(00)00006-6zbMath0963.05057OpenAlexW2062819334MaRDI QIDQ1579549

N. V. R. Mahadev, Daniel Kobler, Alain Hertz, Dominique de Werra

Publication date: 28 June 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00006-6

zbMATH Keywords

timetablingcostcardinality constraintsedge colouring

Mathematics Subject Classification ID

Dynamic programming (90C39) Coloring of graphs and hypergraphs (05C15)

Related Items

Bounded max-colorings of graphs, Four decades of research on the open-shop scheduling problem to minimize the makespan, Locally boundedk-colorings of trees, Minimum entropy coloring, Graph coloring with cardinality constraints on the neighborhoods, Edge dominating set and colorings on graphs with fixed clique-width