Thresholds for classes of intersection graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4177086 (Why is no real title available?)
- scientific article; zbMATH DE number 4200260 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3981198 (Why is no real title available?)
- scientific article; zbMATH DE number 3769674 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- Comparability graphs and intersection graphs
- Intersection graphs of curves in the plane
- Intersection graphs of segments
- Intersection representations of graphs by arcs
- Poisson convergence and Poisson processes with applications to random graphs
- Reducing prime graphs and recognizing circle graphs
- String graphs requiring exponential representations
- String graphs. II: Recognizing string graphs is NP-hard
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Topology of Thin Film RC Circuits
- Transitive Orientation of Graphs and Identification of Permutation Graphs
Cited in
(17)- The graphs with maximum induced matching and maximum matching the same size
- Minimum weight feedback vertex sets in circle \(n\)-gon graphs and circle trapezoid graphs
- Covering and coloring polygon-circle graphs
- Threshold hypergraphs
- Independent packings in structured graphs
- On the structure of certain intersection graphs
- Enumerating threshold graphs and some related graph classes
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Distinguishing threshold of graphs
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs
- Algorithms for maximum weight induced paths
- New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs
- On the pairwise compatibility property of some superclasses of threshold graphs
- Induced matchings in intersection graphs.
- 3D-interval-filament graphs
- Finding a maximum induced matching in weakly chordal graphs
- Refining the hierarchies of classes of geometric intersection graphs
This page was built for publication: Thresholds for classes of intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201264)
