Publication:4414485
From MaRDI portal
zbMath1022.68090MaRDI QIDQ4414485
Andreas Brandstädt, Feodor F. Dragan, Raffaele Mosca, Hoàng-Oanh Le
Publication date: 25 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2573/25730057.htm
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
On minimal prime extensions of a four-vertex graph in a prime graph, A local characterization of bounded clique-width for line graphs, Line graphs of bounded clique-width, Vertex disjoint paths on clique-width bounded graphs, On the relationship between NLC-width and linear NLC-width