Clique-width of partner-limited graphs

DOI10.1016/S0012-365X(03)00295-4MaRDI QIDQ1422439zbMATH OpenFDO

Authors Jean-Marie Vanherpe

Publication date 14 February 2004

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Modular decompositionClique-widthOptimization problems

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Clique width of partner limited graphs
• On the clique-width of graph with few \(P_{4}\)'s
• New graph classes of bounded clique-width
• On graphs with limited number of \(P_{4}\)-partners
• scientific article; zbMATH DE number 1953082

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 1375569 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1262783 (Why is no real title available?)
• Bipartite graphs totally decomposable by canonical decomposition
• Handle-rewriting hypergraph grammars
• On graphs with limited number of \(P_{4}\)-partners
• On the structure of graphs with few \(P_4\)s
• Upper bounds to the clique width of graphs

Cited in

(8)

• Optimal centrality computations within bounded clique-width graphs
• THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
• Recent developments on graphs of bounded clique-width
• On graphs with limited number of \(P_{4}\)-partners
• Clique width of partner limited graphs
• Clique-width of countable graphs: a compactness property
• \(b\)-coloring parameterized by clique-width
• Compact representation of graphs of small clique-width

This page was built for publication: Clique-width of partner-limited graphs

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