Algorithms for finding in the lump both bounds of the chromatic number of a graph
From MaRDI portal
Publication:4109290
DOI10.1093/comjnl/19.4.329zbMath0341.68025OpenAlexW2162274057MaRDI QIDQ4109290
No author found.
Publication date: 1976
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/19.4.329
Symbolic computation and algebraic computation (68W30) Coloring of graphs and hypergraphs (05C15) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (4)
On a reduction of the interval coloring problem to a series of bandwidth coloring problems ⋮ Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths ⋮ Construction of university faculty timetables using logic programming techniques ⋮ About equivalent interval colorings of weighted graphs
This page was built for publication: Algorithms for finding in the lump both bounds of the chromatic number of a graph
