scientific article

zbMath1274.05160MaRDI QIDQ2857388

Pascal Ochem, Petru Valicov, Hervé Hocquard

Publication date: 1 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001442

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induced matchings in bipartite graphs
• Some simplified NP-complete graph problems
• On the computational complexity of strong edge coloring
• The strong chromatic index ofC4-free graphs

This page was built for publication: