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.68025MaRDI 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
68W30: Symbolic computation and algebraic computation
05C15: Coloring of graphs and hypergraphs
68N01: General topics in the theory of software
68W99: Algorithms in computer science
Related Items
On a reduction of the interval coloring problem to a series of bandwidth coloring problems, About equivalent interval colorings of weighted graphs, Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths, Construction of university faculty timetables using logic programming techniques