A Characterization of Soft Hypergraphs

DOI10.4153/CMB-1978-058-5MaRDI QIDQ4172086zbMATH OpenFDO

Authors Peter Slater

Publication date 1978

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CMB-1978-058-5

zbMATH Keywords

Helly PropertySoft HypergraphsSubtreeTree

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65)

Cited in

(11)

• On minimal vertex separators of dually chordal graphs: properties and characterizations
• Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
• Vertices removal for feasibility of clustered spanning trees
• Applying a hypergraph to determine the structure of some finite modules
• Decomposing the feasibility of clustered spanning tree by paths
• Studying some semisimple modules via hypergraphs
• Exploring some modules through inclusion hypergraphs
• A hypergraph on modules and singularity condition
• Insertion and removal lists gaining clustered subtrees
• On the complexity of community-aware network sparsification
• Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication: A Characterization of Soft Hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4172086)