Pages that link to "Item:Q3960133"

The following pages link to An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (Q3960133):

Displayed 19 items.

• Efficient parallel recognition of some circular arc graphs. II (Q675297) ‎ (← links)
• Hadwiger's conjecture for proper circular arc graphs (Q1024291) ‎ (← links)
• Finding Hamiltonian circuits in proper interval graphs (Q1050117) ‎ (← links)
• An O(qn) algorithm to q-color a proper family of circular arcs (Q1060020) ‎ (← links)
• Interval graphs and related topics (Q1060229) ‎ (← links)
• Dominating sets and domatic number of circular arc graphs (Q1066921) ‎ (← links)
• Some parallel algorithms on interval graphs (Q1098312) ‎ (← links)
• Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) ‎ (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) ‎ (← links)
• Efficient parallel recognition of some circular arc graphs. I (Q1209733) ‎ (← links)
• Periodic assignment and graph colouring (Q1329789) ‎ (← links)
• Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) ‎ (← 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)
• (Q2741507) ‎ (← links)
• On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices (Q3439149) ‎ (← links)
• The complexity of path coloring and call scheduling (Q5941061) ‎ (← links)
• Circular-arc graph coloring: On chords and circuits in the meeting graph (Q5953338) ‎ (← links)