scientific article; zbMATH DE number 1534645

MaRDI QIDQ4517443zbMATH OpenFDO

Authors Vadim Lozin

Publication date 21 November 2000

zbMATH Keywords

\(H\)-free graphbipartite graphcharacterizationindices subgraph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• An attractive class of bipartite graphs
• The structure and the number of \(P_7\)-free bipartite graphs
• On the jump number problem in hereditary classes of bipartite graphs
• The structure and the number of \(P_7\)-free bipartite graphs
• Equimatchable bipartite graphs

Cited in

(8)

• Chordal bipartite graphs of bounded tree- and clique-width
• Applications of E-graphs in network design
• The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs
• Tree pivot-minors and linear rank-width
• The structure and the number of \(P_7\)-free bipartite graphs
• On minimal forbidden subgraph characterizations of balanced graphs
• Tree pivot-minors and linear rank-width
• Augmenting graphs for independent sets

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 Q4517443)