Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Definable decompositions for graphs of bounded linear cliquewidth

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2021
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030187672305664
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:5676
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2021
publishDateSort 2021
record_format rss_article
spellingShingle Definable decompositions for graphs of bounded linear cliquewidth
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display Computer Science & Information Science
Computer Science & IT
Engineering & Technology
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
subject_facet Computer Science & Information Science
Computer Science & IT
Engineering & Technology
title Definable decompositions for graphs of bounded linear cliquewidth
title_auth Definable decompositions for graphs of bounded linear cliquewidth
title_full Definable decompositions for graphs of bounded linear cliquewidth
title_fullStr Definable decompositions for graphs of bounded linear cliquewidth
title_full_unstemmed Definable decompositions for graphs of bounded linear cliquewidth
title_short Definable decompositions for graphs of bounded linear cliquewidth
title_sort definable decompositions for graphs of bounded linear cliquewidth
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.23638/LMCS-17(1:5)2021