scientific article; zbMATH DE number 969115
From MaRDI portal
Publication:5284584
DOI<365::AID-JGT6>3.0.CO;2-P 10.1002/(SICI)1097-0118(199612)23:4<365::AID-JGT6>3.0.CO;2-PzbMath0870.05018MaRDI QIDQ5284584
Publication date: 22 January 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
Clique and chromatic number of circular-perfect graphs ⋮ Integer round-up property for the chromatic number of some \(h\)-perfect graphs ⋮ Circular coloring of graphs via linear programming and tabu search ⋮ Computing clique and chromatic number of circular-perfect graphs in polynomial time ⋮ On a reduction of the interval coloring problem to a series of bandwidth coloring problems ⋮ On circular-perfect graphs: a survey ⋮ Resource-sharing system scheduling and circular chromatic number ⋮ Computing the clique number of \(a\)-perfect graphs in polynomial time ⋮ A connection between circular colorings and periodic schedules ⋮ On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs ⋮ Circular chromatic numbers of Mycielski's graphs
This page was built for publication:
