THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
From MaRDI portal
Publication:3526986
DOI10.1142/S0129054108005772zbMath1155.68057MaRDI QIDQ3526986
Publication date: 25 September 2008
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
Related Items
Colouring of graphs with Ramsey-type forbidden subgraphs, Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time, Minimal classes of graphs of unbounded clique-width, Colouring vertices of triangle-free graphs without forests, Recent developments on graphs of bounded clique-width, Coloring graphs without short cycles and long induced paths, Colouring Vertices of Triangle-Free Graphs
Cites Work
- Bi-complement reducible graphs
- Clique-width of partner-limited graphs
- Chordal bipartite graphs of bounded tree- and clique-width
- Bipartite graphs without a skew star
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Handle-rewriting hypergraph grammars
- Approximating clique-width and branch-width
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
- BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
