scientific article; zbMATH DE number 1953082
From MaRDI portal
Publication:4414485
zbMath1022.68090MaRDI QIDQ4414485
Hoàng-Oanh Le, Raffaele Mosca, Feodor F. Dragan, Andreas Brandstädt
Publication date: 25 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2573/25730057.htm
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) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
A local characterization of bounded clique-width for line graphs ⋮ Characterizations of \((4 K_1,C_4,C_5)\)-free graphs ⋮ The coloring problem for classes with two small obstructions ⋮ Line graphs of bounded clique-width ⋮ On minimal prime extensions of a four-vertex graph in a prime graph ⋮ Vertex disjoint paths on clique-width bounded graphs ⋮ On the relationship between NLC-width and linear NLC-width
This page was built for publication:
