scientific article; zbMATH DE number 2044940

zbMATH Open1042.68637MaRDI QIDQ4448762FDOQ4448762

Authors: Öjvind Johansson 

Publication date: 18 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2204/22040229.htm

Title of this publication is not available (Why is that?)

Recommendations

• NLC\(_{2}\)-decomposition in polynomial time
• scientific article; zbMATH DE number 1420903
• On powers of graphs of bounded NLC-width (clique-width)
• On a disparity between relative cliquewidth and relative NLC-width
• NLC-2 Graph Recognition and Isomorphism

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (9)

• Directed NLC-width
• Practical algorithms for MSO model-checking on tree-decomposable graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On a disparity between relative cliquewidth and relative NLC-width
• NLC\(_{2}\)-decomposition in polynomial time
• Approximating clique-width and branch-width
• NLC-2 Graph Recognition and Isomorphism
• Graph-Theoretic Concepts in Computer Science

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 Q4448762)