scientific article; zbMATH DE number 1998816

MaRDI QIDQ4433446zbMATH OpenFDO

Authors Marek Kubale

Publication date 24 November 2003

zbMATH Keywords

approximation algorithmschromatic indexcomplexity resultsgraph coloring problemsNP-hard

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Edge-Coloring Problems for Graphs.
• A polyhedral approach to edge coloring
• A better than “best possible” algorithm to edge color multigraphs
• Edge-coloring of multigraphs
• Experimental and Efficient Algorithms

Cited in

(10)

• A polyhedral approach to edge coloring
• Graph edge coloring: a survey
• New algorithm for calculating chromatic index of graphs and its applications
• Edge coloring of graphs, uses, limitation, complexity
• scientific article; zbMATH DE number 1728544 (Why is no real title available?)
• On coloring problems for two-season multigraphs
• Edge-Coloring Problems for Graphs.
• scientific article; zbMATH DE number 1302184 (Why is no real title available?)
• The complexity of an exotic edge coloring of graphs
• A comparison of two edge-coloring formulations

This page was built for publication:

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