Closed graphs are proper interval graphs
From MaRDI portal
Abstract: In this note we prove that every closed graph is up to isomorphism a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
Recommendations
Cited in
(16)- Open-interval graphs versus closed-interval graphs
- Minimum proper interval graphs
- Hankel edge ideals of trees and (semi-)Hamiltonian graphs
- Sequentially Cohen-Macaulay binomial edge ideals of closed graphs
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
- On closed graphs. I
- Hankel ideals of 2-minors associated with pairs of proper intervals graphs
- scientific article; zbMATH DE number 4145958 (Why is no real title available?)
- scientific article; zbMATH DE number 4164913 (Why is no real title available?)
- Metric characterizations of proper interval graphs and tree-clique graphs
- Powers of binomial edge ideals with quadratic Gröbner bases
- Closed binomial edge ideals
- Blowup algebras of determinantal ideals in prime characteristic
- F-purity of binomial edge ideals
- Koszul binomial edge ideals
- Combinatorics of Castelnuovo-Mumford regularity of binomial edge ideals
This page was built for publication: Closed graphs are proper interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2937311)
