On \(k\)-coloring of weighted circular-arc graphs

zbMATH Open1061.05089MaRDI QIDQ1768168

Jianping Li, Lusheng Wang

Publication date: 14 March 2005

Published in: Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmcoloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Hadwiger's conjecture for circular colorings of edge-weighted graphs ⋮ A note on circular colorings of edge-weighted digraphs ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ An \(0(n^{1.5})\) algorithm to color proper circular arcs

Recommendations

• A note on circular colorings of edge-weighted digraphs 👍 👎
• Hadwiger's conjecture for circular colorings of edge-weighted graphs 👍 👎
• Clique-coloring circular-arc graphs 👍 👎
• Circular colorings of edge-weighted graphs 👍 👎
• Circular-arc graph coloring: On chords and circuits in the meeting graph 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: On \(k\)-coloring of weighted circular-arc graphs

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