Pages that link to "Item:Q1060020"
From MaRDI portal
The following pages link to An O(qn) algorithm to q-color a proper family of circular arcs (Q1060020):
Displayed 11 items.
- Edge-coloring of 3-uniform hypergraphs (Q729801) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- An \(0(n^{1.5})\) algorithm to color proper circular arcs (Q1824396) (← links)
- Precoloring extension on unit interval graphs (Q2492199) (← links)
- Perfect circular arc coloring (Q2569164) (← links)
- (Q2741357) (← links)
- Bounding χ in terms of ω and Δ for quasi-line graphs (Q3605150) (← links)
- Intersection graphs of proper subtrees of unicyclic graphs (Q4309989) (← links)
- Circular-arc graph coloring: On chords and circuits in the meeting graph (Q5953338) (← links)