On H-topological intersection graphs
From MaRDI portal
Recommendations
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- Algorithm Theory - SWAT 2004
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithmic graph theory and perfect graphs
- Algorithms on circular-arc graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Bidimensional Parameters and Local Treewidth
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- Combinatorial problems on \(H\)-graphs
- Decomposition by clique separators
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
- Dominating Sets in Chordal Graphs
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Extending partial representations of subclasses of chordal graphs
- Generalized coloring for tree-like graphs
- Graph minors. III. Planar tree-width
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 3908479 (Why is no real title available?)
- scientific article; zbMATH DE number 3706451 (Why is no real title available?)
- Incidence matrices and interval graphs
- Intersection graphs of Helly families of subtrees
- Isomorphism of graph classes related to the circular-ones property
- Large Induced Subgraphs via Triangulations and CMSO
- Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
- Mim-width. II. The feedback vertex set problem
- Minimum Fill-in on Circle and Circular-Arc Graphs
- Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
- On \(H\)-topological intersection graphs
- On list coloring and list homomorphism of permutation and interval graphs
- On the number of minimal separators in graphs
- On the structure of (pan, even hole)-free graphs
- On the tractability of optimization problems on \(H\)-graphs
- Parameterized algorithms
- Precoloring extension. I: Interval graphs
- Reduced clique graphs of chordal graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes
- The complexity of comparability graph recognition and coloring
- The Complexity of the Partial Order Dimension Problem
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The maximum clique problem in multiple interval graphs
- The stable set problem and the thinness of a graph
- The vertex leafage of chordal graphs
- Topology of Thin Film RC Circuits
- Treewidth and minimum fill-in: Grouping the minimal separators
Cited in
(18)- Combinatorial problems on \(H\)-graphs
- On the tractability of optimization problems on \(H\)-graphs
- On \(H\)-linked graphs
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs
- Graphs containing topological H
- scientific article; zbMATH DE number 1899813 (Why is no real title available?)
- On the tractability of optimization problems on \(H\)-graphs
- On \(H\)-topological intersection graphs
- Intersection graphs of non-crossing paths
- Fair allocation algorithms for indivisible items under structured conflict constraints
- Treewidth versus clique number. II: Tree-independence number
- Solving problems on generalized convex graphs via mim-width
- Thinness and its variations on some graph families and coloring graphs of bounded thinness
- Bisimplicial separators
- Computing tree decompositions with small independence number
- The simultaneous interval number: a new width parameter that measures the similarity to interval graphs
- Treewidth versus clique number. V: Further connections with tree-independence number
- Non-crossing H-graphs: a generalization of proper interval graphs admitting FPT algorithms
This page was built for publication: On \(H\)-topological intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925535)
