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