Topics in Intersection Graph Theory

DOI10.1137/1.9780898719802zbMATH Open0945.05003OpenAlexW112858196MaRDI QIDQ4231782FDOQ4231782

Authors: Terry A. McKee, F. R. McMorris 

Publication date: 15 March 1999

Full work available at URL: https://doi.org/10.1137/1.9780898719802

Recommendations

• Threshold graphs and related topics
• scientific article; zbMATH DE number 5575317
• Algorithmic graph theory and its applications
• scientific article; zbMATH DE number 3859178
• scientific article; zbMATH DE number 2229025

zbMATH Keywords

characterizationsintersection graphsinterval graphschordal graphsline graphsthreshold graphscompetition graphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Enumeration in graph theory (05C30)

Cited In (only showing first 100 items - show all)

• Strengthening strongly chordal graphs
• The minimum-area spanning tree problem
• On graphs of bounded semilattices
• Towards a comprehensive theory of conflict-tolerance graphs
• The adjacency matrix of a graph as a data table: a geometric perspective
• On cover-structure graphs
• Proper circular arc graphs as intersection graphs of paths on a grid
• Chordally signed graphs
• An approach to solving \(A^{k}=J-I\)
• Subgraph trees in graph theory
• Obstacle numbers of graphs
• The dynamic team forming problem: throughput and delay for unbiased policies
• Maxclique and unit disk characterizations of strongly chordal graphs
• Planar drawings of fixed-mobile bigraphs
• Fixed cardinality stable sets
• Exact leaf powers
• Kneser ranks of random graphs and minimum difference representations
• Kneser ranks of random graphs and minimum difference representations
• Algorithmic graph theory and its applications
• The composition of semi-finished inventories at a solid board plant.
• A simple algorithm to find Hamiltonian cycles in proper interval graphs
• Title not available (Why is that?)
• Cube intersection concepts in median graphs
• Paired threshold graphs
• Parikh word representability of bipartite permutation graphs
• Reconstructing pedigrees: a stochastic perspective
• 3-coloring arrangements of line segments with 4 slopes is hard
• A new characterization of strongly chordal graphs
• A new characterization of unichord-free graphs
• Intersection graphs of non-crossing paths
• Homothetic polygons and beyond: maximal cliques in intersection graphs
• New work for Carnap's quasi-analysis
• On the number of maximal independent sets in minimum colorings of split graphs
• Strict chordal digraphs viewed as graphs with distinguished edges
• Distance Labeling for Permutation Graphs
• Competition polysemy
• Scale free interval graphs
• The longest path problem is polynomial on cocomparability graphs
• Almost every graph is divergent under the biclique operator
• On orthogonal ray trees
• Intersection graphs of orthodox paths in trees
• A dynamic distributed approach to representing proper interval graphs
• On the small intersection graph of submodules of a module
• Requiring that minimal separators induce complete multipartite subgraphs
• Intersection graphs of rays and grounded segments
• TREE DIAGRAMS FOR STRING LINKS
• Subexponential interval graphs generated by immigration-death processes
• Efficient local representations of graphs
• Factoring Boolean functions using graph partitioning
• Recognizing and representing proper interval graphs in parallel using merging and sorting
• On clique coverings of complete multipartite graphs
• Packing of (0, 1)-matrices
• Finding a maximum-weight convex set in a chordal graph
• On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
• Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
• When all minimal vertex separators induce complete or edgeless subgraphs
• Symmetric graph-theoretic roles of two-pairs and chords of cycles
• Interval \(k\)-graphs and orders
• Intersection graphs of maximal hypercubes
• Toll convexity
• Split clique graph complexity
• On the iterated biclique operator
• Localized and compact data-structure for comparability graphs
• Dot product dimensions of graphs
• On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
• On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
• Maximum weight independent sets in hole- and co-chair-free graphs
• On the isomorphism problem for Helly circular-arc graphs
• Separator orders in interval, cocomparability, and AT-free graphs
• The intersection graph of gamma sets in the total graph of a commutative ring. I
• A SLLN for a one-dimensional class cover problem
• On the iterated edge-biclique operator
• Simple Geometrical Intersection Graphs
• Finding intersection models: from chordal to Helly circular-arc graphs
• Characterizing and computing the structure of clique intersections in strongly chordal graphs
• A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
• Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
• The maximum edit distance from hereditary graph properties
• Dynamic Distance Hereditary Graphs Using Split Decomposition
• Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
• Enumeration of the perfect sequences of a chordal graph
• Maximum area independent sets in disk intersection graphs
• Extending partial representations of interval graphs
• A new analysis of quasianalysis
• Hyperplanes of Squier's cube complexes
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
• A new family of proximity graphs: class cover catch digraphs
• Contact representations of planar graphs: extending a partial representation is hard
• The P versus NP-complete dichotomy of some challenging problems in graph theory
• Graphs with the maximum or minimum number of 1-factors
• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
• On the hyperbolicity constant of circular-arc graphs
• The recognition of triangle graphs
• Tractabilities and intractabilities on geometric intersection graphs
• Extending partial representations of subclasses of chordal graphs
• Algorithmic graph theory and perfect graphs
• Adjacency matrices of probe interval graphs
• Random subcube intersection graphs. I: Cliques and covering
• Maximal pivots on graphs with an application to gene assembly
• Biclique covers and partitions

This page was built for publication: Topics in Intersection Graph Theory

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