On closed graphs. I

zbMATH Open1349.05282arXiv1306.5149MaRDI QIDQ2804843FDOQ2804843

Authors: David A. Cox, Andrew Erskine 

Publication date: 4 May 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1306.5149

Recommendations

• On closed graphs. II
• On \(m\)-closed graphs
• Closed graphs are proper interval graphs
• Closed orders and closed graphs
• The \(*\)-closure for graphs and claw-free graphs

zbMATH Keywords

closed graphchordal graphbinomial edge ideal

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (13)

• Title not available (Why is that?)
• Closed graphs are proper interval graphs
• On closed graphs. II
• On \(m\)-closed graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On graph closures
• Binomial edge ideals with pure resolutions
• Title not available (Why is that?)
• Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
• Linear flags and Koszul filtrations
• On the extremal Betti numbers of the binomial edge ideal of closed graphs

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)