2008 | OriginalPaper | Chapter
Graphs of Linear Clique-Width at Most 3
Authors : Pinar Heggernes, Daniel Meister, Charis Papadopoulos
Published in: Theory and Applications of Models of Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We give the first characterisation of graphs of linear clique-width at most 3, and we give a polynomial-time recognition algorithm for such graphs.