Circular representation problem on hypergraphs
From MaRDI portal
Recommendations
- On the problem of how to represent a graph taking into account an additional structure
- Circular-arc hypergraphs: rigidity via connectedness
- Graphs and digraphs represented by intervals and circular arcs
- scientific article; zbMATH DE number 638686
- Representation theorems for graphs whose vertex set is partially ordered
Cites work
- A structure theorem for the consecutive 1's property
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Combinatorial Configurations
- scientific article; zbMATH DE number 3889566 (Why is no real title available?)
- scientific article; zbMATH DE number 3641484 (Why is no real title available?)
- Incidence matrices and interval graphs
- Structure theorems for some circular-arc graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Strong Perfect Graph Conjecture for Planar Graphs
Cited in
(11)- On the problem of how to represent a graph taking into account an additional structure
- Algorithmic aspects of intersection graphs and representation hypergraphs
- An approach to solving \(A^{k}=J-I\)
- Combinatorial optimisation and hierarchical classifications
- scientific article; zbMATH DE number 638686 (Why is no real title available?)
- An Optimal Algorithm for Strict Circular Seriation
- Circular-arc hypergraphs: rigidity via connectedness
- On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs
- Cyclic orders
- A Simple and Optimal Algorithm for Strict Circular Seriation
- Intersection representations of matrices by subtrees and unicycles on graphs
This page was built for publication: Circular representation problem on hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799695)
