Studies on hypergraphs. I: Hyperforests

DOI10.1016/0166-218X(93)90182-NzbMath0774.05074OpenAlexW2008378479WikidataQ126353017 ScholiaQ126353017MaRDI QIDQ1209154

Lianwen Zhang

Publication date: 16 May 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90182-n

zbMATH Keywords

decompositionhypergraphshyperforestsMarkov treestwig sequence

Mathematics Subject Classification ID

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

Related Items

Standard graded vertex cover algebras, cycles and leaves ⋮ Perspectives on the theory and practice of belief functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Markov fields and log-linear interaction models for contingency tables
• Incidence matrices and interval graphs
• Contribution to nonserial dynamic programming
• Triangulated graphs and the elimination process
• 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
• Complexity of Finding Embeddings in a k-Tree
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

This page was built for publication: Studies on hypergraphs. I: Hyperforests