A characterization of totally balanced hypergraphs
From MaRDI portal
Publication:1066918
DOI10.1016/0012-365X(85)90156-6zbMath0579.05041MaRDI QIDQ1066918
Publication date: 1985
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
On hypergraph acyclicity and graph chordality ⋮ Binary set systems and totally balanced hypergraphs ⋮ The algorithmic use of hypertree structure and maximum neighbourhood orderings ⋮ Feedback vertex sets on restricted bipartite graphs ⋮ Dually chordal graphs ⋮ Subgraph trees in graph theory ⋮ On the complexity of the black-and-white coloring problem on some classes of perfect graphs ⋮ Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs ⋮ On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs ⋮ Hardness and structural results for half-squares of restricted tree convex bipartite graphs ⋮ Construction of a simple elimination scheme for a chordal comparability graph in linear time ⋮ Totally balanced dissimilarities ⋮ Totally Balanced Formal Context Representation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypergraphs with no special cycles
- Graphs whose neighborhoods have no special cycles
- Characterizations of strongly chordal graphs
- Hypergraphs without a large star
- On hypergraphs without significant cycles
- Hypergraphes arbores
- Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
- Characterizations of totally balanced matrices
- Totally-Balanced and Greedy Matrices
- Convexity in Graphs and Hypergraphs
- Combinatorial Configurations
This page was built for publication: A characterization of totally balanced hypergraphs