Overlaying a hypergraph with a graph with bounded maximum degree
From MaRDI portal
Recommendations
- Overlaying a hypergraph with a graph with bounded maximum degree
- Overfull conjecture for graphs with high minimum degree
- The overfullness of graphs with small minimum degree and large maximum degree
- On embedding graphs with bounded sum of size and maximum degree
- Bounding the vertex cover number of a hypergraph
- On -overlap graphs
- How to find overfull subgraphs in graphs with large maximum degree. II
- scientific article; zbMATH DE number 3887743
- scientific article; zbMATH DE number 4012650
- Covering a hypergraph of subgraphs
Cites work
- A simple existence criterion for \((g<f)\)-factors
- Algorithms and Implementation for Interconnection Graph Problem
- Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Constructing scalable overlays for pub-sub with many topics
- Graph theory
- Graphs, networks and algorithms.
- Hypergraph planarity and the complexity of drawing venn diagrams
- Inferring Social Networks from Outbreaks
- Interval graph representation with given interval and intersection lengths
- Matroids and Subset Interconnection Design
- On complexity of subset interconnection designs
- Polynomial-time data reduction for the subset interconnection design problem
- Reducibility among combinatorial problems
Cited in
(6)- Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem
- Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem
- Overlaying a hypergraph with a graph with bounded maximum degree
- On hypergraph supports (extended abstract)
- A fast algorithm for computing a planar support for non-piercing rectangles
- On supports for graphs of bounded genus
This page was built for publication: Overlaying a hypergraph with a graph with bounded maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918772)
