Thresholds for classes of intersection graphs
From MaRDI portal
Publication:1201264
DOI10.1016/0012-365X(92)90684-8zbMATH Open0769.05084MaRDI QIDQ1201264FDOQ1201264
Authors: Svante Janson, Jan Kratochvíl
Publication date: 17 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Poisson convergence and Poisson processes with applications to random graphs
- Comparability graphs and intersection graphs
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- A Characterization of Comparability Graphs and of Interval Graphs
- Intersection graphs of segments
- Reducing prime graphs and recognizing circle graphs
- Intersection graphs of curves in the plane
- Title not available (Why is that?)
- Topology of Thin Film RC Circuits
- String graphs. II: Recognizing string graphs is NP-hard
- String graphs requiring exponential representations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intersection representations of graphs by arcs
- Title not available (Why is that?)
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
- Refining the hierarchies of classes of geometric intersection graphs
- Finding a maximum induced matching in weakly chordal 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)