Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686MaRDI QIDQ5897545zbMATH OpenFDO

Authors Frank Gurski, Egon Wanke

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Line graphs of bounded clique-width
• On the relationship between NLC-width and linear NLC-width
• On a disparity between relative cliquewidth and relative NLC-width
• A local characterization of bounded clique-width for line graphs
• scientific article; zbMATH DE number 2044940

Cited in

(11)

• On a disparity between relative cliquewidth and relative NLC-width
• Vertex-minors of graphs: a survey
• On switching classes, NLC-width, cliquewidth and treewidth
• Characterizations for restricted graphs of NLC-width 2
• Vertex disjoint paths on clique-width bounded graphs
• A local characterization of bounded clique-width for line graphs
• Well-quasi-order of relabel functions
• Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
• On the relationship between NLC-width and linear NLC-width
• Linear layouts measuring neighbourhoods in graphs
• Line graphs of bounded clique-width

This page was built for publication: Graph-Theoretic Concepts in Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897545)