Circular representation problem on hypergraphs
From MaRDI portal
Publication:799695
DOI10.1016/0012-365X(84)90006-2zbMath0548.05047MaRDI QIDQ799695
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Cyclic orders, Intersection representations of matrices by subtrees and unicycles on graphs, Algorithmic aspects of intersection graphs and representation hypergraphs, An approach to solving \(A^{k}=J-I\), Combinatorial optimisation and hierarchical classifications
Cites Work
- Unnamed Item
- Unnamed Item
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Incidence matrices and interval graphs
- A structure theorem for the consecutive 1's property
- Structure theorems for some circular-arc graphs
- Combinatorial Configurations
- The Strong Perfect Graph Conjecture for Planar Graphs