The following pages link to (Q5284584):
Displaying 20 items.
- Circular coloring of graphs via linear programming and tabu search (Q302132) (← links)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- On a reduction of the interval coloring problem to a series of bandwidth coloring problems (Q633552) (← links)
- A note on circular colorings of edge-weighted digraphs (Q653411) (← links)
- Hadwiger's conjecture for circular colorings of edge-weighted graphs (Q864127) (← links)
- A connection between circular colorings and periodic schedules (Q1028150) (← links)
- Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
- On \(k\)-coloring of weighted circular-arc graphs (Q1768168) (← links)
- Resource-sharing system scheduling and circular chromatic number (Q1770401) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs (Q2364493) (← links)
- Circular \((5,2)\)-coloring of sparse graphs (Q2454506) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514) (← links)
- Clique and chromatic number of circular-perfect graphs (Q2883567) (← links)
- (Q4221701) (← links)
- Circular colorings of edge-weighted graphs (Q4406066) (← links)
- (Q4783168) (← links)
- Testing superperfection of k-trees (Q5056149) (← links)
- Max-coloring of vertex-weighted graphs (Q5964985) (← links)
