Revisiting Tucker's algorithm to color circular-arc graphs

MaRDI QIDQ2741507zbMATH OpenFDO

Authors Mario Valencia-Pabon

Publication date 24 October 2001

zbMATH Keywords

coloringTucker's algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Revisiting Tucker's Algorithm to Color Circular Arc Graphs
• scientific article; zbMATH DE number 140476
• An \(0(n^{1.5})\) algorithm to color proper circular arcs
• Perfect circular arc coloring
• On \(k\)-coloring of weighted circular-arc graphs

Cites work

• An O(n^2 ) Algorithm for Coloring Proper Circular Arc Graphs
• An \(0(n^{1.5})\) algorithm to color proper circular arcs
• Coloring a Family of Circular Arcs
• scientific article; zbMATH DE number 3706474 (Why is no real title available?)
• scientific article; zbMATH DE number 1182769 (Why is no real title available?)
• Intersection graphs of Helly families of subtrees
• Revisiting Tucker's Algorithm to Color Circular Arc Graphs
• The Complexity of Coloring Circular Arcs and Chords

Cited in

(3)

• An \(0(n^{1.5})\) algorithm to color proper circular arcs
• Perfect circular arc coloring
• Revisiting Tucker's Algorithm to Color Circular Arc Graphs

This page was built for publication: Revisiting Tucker's algorithm to color circular-arc graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741507)