Finding a minimal spanning hypertree of a weighted hypergraph

DOI10.1007/s10878-022-00864-zzbMath1498.90202OpenAlexW4280604159MaRDI QIDQ2168776

Gholam Hasan Shirdel, B. Vaez-Zadeh

Publication date: 26 August 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00864-z

zbMATH Keywords

graphhypergraphcombinatorial optimizationweighted graphweighted hypergraphminimal spanning graph

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph theory (educational aspects) (97K30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular subgraphs of uniform hypergraphs
• Hypergraphs in which all disjoint pairs have distinct unions
• On Ramsey numbers of uniform hypergraphs with given maximum degree
• The maximum size of hypergraphs without generalized 4-cycles
• Two-regular subgraphs of hypergraphs
• A hypergraph extension of the bipartite Turán problem
• Maximum hypergraphs without regular subgraphs
• Hypergraph Ramsey numbers
• Connectivity in Hypergraphs
• Connection and separation in hypergraphs

This page was built for publication: Finding a minimal spanning hypertree of a weighted hypergraph