scientific article
From MaRDI portal
Publication:3917502
zbMath0465.68034MaRDI QIDQ3917502
Nobuji Saito, Norishige Chiba, Takao Nishizeki
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items (8)
A fast parallel coloring of planar graphs with five colors ⋮ Improved induced matchings in sparse graphs ⋮ Coloring algorithms for \(K_ 5\)-minor free graphs ⋮ Guarding polyhedral terrains ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Extending planar graph algorithms to \(K_{3,3}\)-free graphs ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems) ⋮ Colouring the discretization graphs arising in the multigrid method
This page was built for publication:
