scientific article; zbMATH DE number 1759439

MaRDI QIDQ4536388zbMATH OpenFDO

Authors Vadim Lozin

Publication date 25 June 2002

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Bi-complement reducible graphs
• Polar cographs
• Cographs whose complements consist of \(k\)-partite components
• An attractive class of bipartite graphs
• Chordal bipartite graphs of bounded tree- and clique-width

Cited in

(7)

• Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
• Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement
• On maximum induced matchings in bipartite graphs
• Chordal bipartite graphs of bounded tree- and clique-width
• Bipartite graphs without a skew star
• A generalization of Eagon–Reiner’s theorem and a characterization of bi-CM_t bipartite and chordal graphs
• An attractive class of bipartite graphs

This page was built for publication:

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