Blocks of hypergraphs. Applied to hypergraphs and outerplanarity

DOI10.1007/978-3-642-19222-7_21MaRDI QIDQ3000508zbMATH OpenOpenAlexFDO

Authors Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry

Publication date 19 May 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19222-7_21

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Hypergraphs (05C65)

Recommendations

• On planar supports for hypergraphs
• On planar supports for hypergraphs
• Path-based supports for hypergraphs
• Path-based supports for hypergraphs
• Short plane supports for spatial hypergraphs

Cites work

• Algorithms for the Hypergraph and the Minor Crossing Number Problems
• Decidability of string graphs
• Diagrammatic Representation and Inference
• Diagrammatic Representation and Inference
• Diagrammatic representation and inference. Third international conference, Diagrams 2004, Cambridge, UK, March 22--24, 2004. Proceedings.
• Efficient Planarity Testing
• Graph Drawing
• How to draw a hypergraph
• Hypergraph planarity and the complexity of drawing venn diagrams
• Hypermaps versus bipartite maps
• Mixed hypercacti
• On planar supports for hypergraphs
• On planar supports for hypergraphs
• On the Desirability of Acyclic Database Schemes
• Orthogonal Hypergraph Drawing for Improved Visibility
• Overlapping Cluster Planarity
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Subdivision Drawings of Hypergraphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The clustering matroid and the optimal clustering tree

Cited in

(14)

• On planar supports for hypergraphs
• scientific article; zbMATH DE number 763372 (Why is no real title available?)
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Decomposing the feasibility of clustered spanning tree by paths
• Hypergraph edge representations with the use of homological paths
• The role of twins in computing planar supports of hypergraphs
• Twins in Subdivision Drawings of Hypergraphs
• More on block intersection polynomials and new applications to graphs and block designs
• Overlaying a hypergraph with a graph with bounded maximum degree
• Path-based supports for hypergraphs
• Path-based supports for hypergraphs
• Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem
• On planar supports for hypergraphs
• On the cut-vertex and the interval transit functions of hypergraphs

This page was built for publication: Blocks of hypergraphs. Applied to hypergraphs and outerplanarity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000508)