Studies on hypergraphs. I: Hyperforests
From MaRDI portal
Publication:1209154
Recommendations
Cites work
- scientific article; zbMATH DE number 3152801 (Why is no real title available?)
- scientific article; zbMATH DE number 3168327 (Why is no real title available?)
- scientific article; zbMATH DE number 3845624 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 4112072 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Complexity of Finding Embeddings in a k-Tree
- Contribution to nonserial dynamic programming
- Incidence matrices and interval graphs
- Markov fields and log-linear interaction models for contingency tables
- On rigid circuit graphs
- On the Desirability of Acyclic Database Schemes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Triangulated graphs and the elimination process
Cited in
(5)- Perspectives on the theory and practice of belief functions
- scientific article; zbMATH DE number 718859 (Why is no real title available?)
- Standard graded vertex cover algebras, cycles and leaves
- Approachable graph (tree) and its application in hyper (network)
- Further study on sizes of acyclic hypergraphs
This page was built for publication: Studies on hypergraphs. I: Hyperforests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209154)