Bipartite graphs of large clique-width

DOI10.1007/978-3-642-10217-2_38MaRDI QIDQ3651565zbMATH OpenOpenAlexFDO

Authors Nicholas Korpelainen, Vadim Lozin

Publication date 11 December 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-10217-2_38

zbMATH Keywords

clique-widthhereditary classtree-width

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A new graph construction of unbounded clique-width
• scientific article; zbMATH DE number 2191997
• Between clique-width and linear clique-width of bipartite graphs
• scientific article; zbMATH DE number 1696534
• The tree- and clique-width of bipartite graphs in special classes

Cited in

(10)

• The size of the largest bipartite subgraphs
• On large bipartite graphs of diameter 3
• Clique width of partner limited graphs
• THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
• Degree-two Inequalities, Clique Facets, and Biperfect Graphs
• scientific article; zbMATH DE number 1750103 (Why is no real title available?)
• A new graph construction of unbounded clique-width
• scientific article; zbMATH DE number 2191997 (Why is no real title available?)
• On a problem of a. kotzig concerning factorizations of 4‐regular graphs
• A class of graphs with large rankwidth

This page was built for publication: Bipartite graphs of large clique-width

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