On the minimum feasible graph for four sets

DOI10.1007/BF02662501zbMath0841.05044OpenAlexW2082423080MaRDI QIDQ1908609

Xiaobing Fu, Yin-Feng Xu

Publication date: 4 March 1996

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02662501

zbMATH Keywords

spanning treeNP-completefeasible graphpolynomial-time solvable

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• An optimization problem on graphs
• Matroids and Subset Interconnection Design
• Unnamed Item
• Unnamed Item

This page was built for publication: On the minimum feasible graph for four sets