scientific article; zbMATH DE number 1104337

MaRDI QIDQ4370210zbMATH OpenFDO

Authors Penny Haxell, Martin Loebl

Publication date 25 April 1999

zbMATH Keywords

bipartite graphscomplexitydefect setmatroids

Mathematics Subject Classification ID

Graph theory (05C99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Expanding graphs contain all small trees
• Publication:4734768
• scientific article; zbMATH DE number 4198042
• scientific article; zbMATH DE number 2044920
• Tight bounds for embedding bounded degree trees
• scientific article; zbMATH DE number 2104823
• Graph searching and a min-max theorem for tree-width
• scientific article; zbMATH DE number 4066936
• On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
• scientific article; zbMATH DE number 6694457

Cited in

(4)

• scientific article; zbMATH DE number 5532004 (Why is no real title available?)
• scientific article; zbMATH DE number 4103133 (Why is no real title available?)
• M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities
• Characterizing defect n-extendable bipartite graphs with different connectivities

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