Circular representation problem on hypergraphs

DOI10.1016/0012-365X(84)90006-2zbMath0548.05047MaRDI QIDQ799695

Alain Quilliot

Publication date: 1984

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

zbMATH Keywords

circular graphscircular representationinterval-representable hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (9)

A Simple and Optimal Algorithm for Strict Circular Seriation ⋮ Algorithmic aspects of intersection graphs and representation hypergraphs ⋮ An approach to solving \(A^{k}=J-I\) ⋮ Intersection representations of matrices by subtrees and unicycles on graphs ⋮ Circular-arc hypergraphs: rigidity via connectedness ⋮ Combinatorial optimisation and hierarchical classifications ⋮ Cyclic orders ⋮ An Optimal Algorithm for Strict Circular Seriation ⋮ On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs

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

This page was built for publication: Circular representation problem on hypergraphs