Classifying the Clique-Width of H-Free Bipartite Graphs

DOI10.1007/978-3-319-08783-2_42zbMath1425.05114OpenAlexW2489339695MaRDI QIDQ2920484

Daniël Paulusma, Konrad K. Dabrowski

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)

Related Items (6)

Bounding the Clique-Width of H-free Chordal Graphs ⋮ Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs ⋮ Classifying the clique-width of \(H\)-free bipartite graphs ⋮ Induced minor free graphs: isomorphism and clique-width ⋮ Bounding the clique-width of \(H\)-free split graphs ⋮ Bounding Clique-Width via Perfect Graphs

This page was built for publication: Classifying the Clique-Width of H-Free Bipartite Graphs