A note on compact and compact circular edge-colorings of graphs

MaRDI QIDQ3575439zbMATH OpenFDO

Authors Dariusz Dereniowski, Adam Nadolski

Publication date 27 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/526/0.html

zbMATH Keywords

approximation algorithmNP-completenessinterval edge-coloringedge-weighted graphcompact edge-coloringcompact circular edge-coloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Compact cyclic edge-colorings of graphs
• On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic
• Circular colorings of edge-weighted graphs
• On the Maximum Edge Coloring Problem
• Weighted coloring on planar, bipartite and split graphs: Complexity and approximation

Cited in

(7)

• scientific article; zbMATH DE number 1454643 (Why is no real title available?)
• Cycle-compelling colorings of graphs
• Compact cyclic edge-colorings of graphs
• Edge Colorings and Circular Flow Numbers of Regular Graphs
• A note on circular colorings of edge-weighted digraphs
• Hadwiger's conjecture for circular colorings of edge-weighted graphs
• On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic

This page was built for publication: A note on compact and compact circular edge-colorings of graphs

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