On closed graphs. I
From MaRDI portal
Publication:2804843
Abstract: A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we prove that a connected graph has a closed labeling if and only if it is chordal, claw-free, and has a property we call narrow, which holds when every vertex is distance at most one from all longest shortest paths of the graph.
Recommendations
Cited in
(13)- Binomial edge ideals with pure resolutions
- scientific article; zbMATH DE number 4164913 (Why is no real title available?)
- On the extremal Betti numbers of the binomial edge ideal of closed graphs
- scientific article; zbMATH DE number 4145958 (Why is no real title available?)
- scientific article; zbMATH DE number 4130403 (Why is no real title available?)
- On \(m\)-closed graphs
- scientific article; zbMATH DE number 434698 (Why is no real title available?)
- On graph closures
- scientific article; zbMATH DE number 90530 (Why is no real title available?)
- Closed graphs are proper interval graphs
- Linear flags and Koszul filtrations
- On closed graphs. II
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
This page was built for publication: On closed graphs. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804843)