Forbidden subgraph characterization of bipartite unit probe interval graphs
From MaRDI portal
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- Characterizing interval graphs which are probe unit interval graphs
- A characterization of cycle-free unit probe interval graphs
- Linear time recognition algorithms and structure theorems for bipartite tolerance graphs and bipartite probe interval graphs
- Probe interval and probe unit interval graphs on superclasses of cographs
- Probe interval graphs and probe unit interval graphs on superclasses of cographs
Cited in
(10)- Recognizing interval bigraphs by forbidden patterns
- Probe interval graphs and STS-probe interval graphs
- Characterizing interval graphs which are probe unit interval graphs
- Recognition of probe proper interval graphs
- A characterization of cycle-free unit probe interval graphs
- A forbidden subgraph characterization of some graph classes using betweenness axioms
- Linear time recognition algorithms and structure theorems for bipartite tolerance graphs and bipartite probe interval graphs
- Bipartite probe interval graphs, circular arc graphs, and interval point bigraphs
- Probe interval graphs and probe unit interval graphs on superclasses of cographs
- A characterization of 2-tree probe interval graphs
This page was built for publication: Forbidden subgraph characterization of bipartite unit probe interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166092)
