Hypertrees

DOI10.1016/S0893-9659(98)00145-1MaRDI QIDQ1808971zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 21 August 2000

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0893-9659(98)00145-1

zbMATH Keywords

characterizationhypergraphhypertreetree

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)

Review text

A generalization of the notion of tree to hypergraphs is introduced. A hypergraph \(H\) is called a hypertree, when the removal of any edge from \(H\) results in a disconnected hypergraph. Several basic properties and characterizations of hypertrees are discussed, amongst others with respect to cycles, bi-colorability, the dual, the transversal and the conformality.

Recommendations

• Sum numbers of hypertrees
• scientific article; zbMATH DE number 3933118
• Ordered \(h\)-hypertrees
• scientific article; zbMATH DE number 3989391

Cited in

(29)

• A characterization of totally balanced hypergraphs
• Multidimensional trees
• Ordered \(h\)-hypertrees
• Studies on hypergraphs. I: Hyperforests
• Forestation in hypergraphs: Linear \(k\)-trees
• Extremal hypercuts and shadows of simplicial complexes
• A recursive formula for the reliability of a r-uniform complete hypergraph and its applications
• Hypertree-depth and minors in hypergraphs
• Asymptotic sharpness of bounds on hypertrees
• A characterization of hypercacti
• In search of hyperpaths
• scientific article; zbMATH DE number 3873374 (Why is no real title available?)
• scientific article; zbMATH DE number 3922702 (Why is no real title available?)
• scientific article; zbMATH DE number 3933118 (Why is no real title available?)
• scientific article; zbMATH DE number 3989391 (Why is no real title available?)
• The number of (d,k)-hypertrees
• scientific article; zbMATH DE number 2107061 (Why is no real title available?)
• On derivable trees
• Tree path labeling of hypergraphs -- a generalization of the consecutive ones property
• Hypergraph LSS-ideals and coordinate sections of symmetric tensors
• Sombor Index of Hypergraphs
• Approachable graph (tree) and its application in hyper (network)
• On a relationship between the characteristic and matching polynomials of a uniform hypertree
• Spanning hypertrees, vertex tours and meanders
• A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
• The first and second Zagreb indices of hypergraphs
• On the sizes of bi-k-edge-maximal r-uniform hypergraphs
• On the sum of the Randić index and the reciprocal Randić index of uniform hypergraphs
• Hypertrees, rooted trees and pointed partitions

This page was built for publication: Hypertrees

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