Classifying the clique-width of H-free bipartite graphs

DOI10.1007/978-3-319-08783-2_42MaRDI QIDQ2920484zbMATH OpenOpenAlexFDO

Authors Konrad Dabrowski, Daniël Paulusma

Publication date 26 September 2014

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

Full work available at URL https://doi.org/10.1007/978-3-319-08783-2_42

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Classifying the clique-width of \(H\)-free bipartite graphs
• Bounding the clique-width of \(H\)-free split graphs
• Bounding the clique-width of \(H\)-free split graphs
• Clique-width of graph classes defined by two forbidden induced subgraphs
• Bounding the clique-width of \(H\)-free chordal graphs

Cited in

(11)

• Bounding the Clique‐Width of H‐Free Chordal Graphs
• Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
• Clique-width and well-quasi-ordering of triangle-free graph classes
• Bounding the clique-width of \(H\)-free split graphs
• Bounding the clique-width of \(H\)-free split graphs
• Classifying the clique-width of \(H\)-free bipartite graphs
• THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
• Bounding clique-width via perfect graphs
• Clique-width of graph classes defined by two forbidden induced subgraphs
• Between clique-width and linear clique-width of bipartite graphs
• Bounding the clique-width of \(H\)-free chordal graphs

This page was built for publication: Classifying the clique-width of \(H\)-free bipartite graphs

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