A characterization of cycle-free unit probe interval graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3566474 (Why is no real title available?)
- scientific article; zbMATH DE number 1735726 (Why is no real title available?)
- scientific article; zbMATH DE number 1933220 (Why is no real title available?)
- scientific article; zbMATH DE number 2119749 (Why is no real title available?)
- scientific article; zbMATH DE number 1439437 (Why is no real title available?)
- 2-tree probe interval graphs have a large obstruction set
- A polynomial time recognition algorithm for probe interval graphs
- Betweenness, orders and interval graphs
- Bipartite probe interval graphs, circular arc graphs, and interval point bigraphs
- Incidence matrices and interval graphs
- On probe interval graphs
Cited in
(10)- A vertex ordering result for tripartite unit probe interval graphs
- scientific article; zbMATH DE number 1990719 (Why is no real title available?)
- 2-tree probe interval graphs have a large obstruction set
- Characterizing interval graphs which are probe unit interval graphs
- Recognition of probe proper interval graphs
- Probe interval and probe unit interval graphs on superclasses of cographs
- Forbidden subgraph characterization of bipartite unit probe interval graphs
- Probe interval graphs and probe unit interval graphs on superclasses of cographs
- A characterization of 2-tree probe interval graphs
- Interval \(k\)-graphs and orders
This page was built for publication: A characterization of cycle-free unit probe interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028472)