Union Closed Tree Convex Sets

DOI10.1007/978-3-319-19647-3_19zbMath1408.05133OpenAlexW1203493243MaRDI QIDQ3452566

Ke Xu, Tian Liu

Publication date: 12 November 2015

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19647-3_19

zbMATH Keywords

Helly propertyhypertreeunion-closed sets conjecturetree convex bipartite graphstree convex sets

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (2)

Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs ⋮ Maximum Edge Bicliques in Tree Convex Bipartite Graphs

Cites Work

• Unnamed Item
• The graph formulation of the union-closed sets conjecture
• Independent Domination on Tree Convex Bipartite Graphs
• Two Hardness Results on Feedback Vertex Sets
• Degrees of acyclicity for hypergraphs and relational database schemes
• Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth
• Perfect Elimination and Chordal Bipartite Graphs
• Graph Classes: A Survey
• A REVIEW OF TREE CONVEX SETS TEST
• Restricted Bipartite Graphs: Comparison and Hardness Results
• Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs
• Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems

This page was built for publication: Union Closed Tree Convex Sets