scientific article; zbMATH DE number 7613130

MaRDI QIDQ5045920zbMATH OpenFDO

Authors Kieran Hilmer, Rom Pinchasi, Vadim Ponomarenko

Publication date 8 November 2022

Full work available at URL https://journals.calstate.edu/pump/article/view/2613

zbMATH Keywords

indifference graphintersection graphinterval graphnumerical monoidnumerical semigroup

Mathematics Subject Classification ID

Vertex degrees (05C07) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Commutative semigroups (20M14)

Cites work

• A Fully dynamic algorithm for recognizing and representing proper interval graphs
• A simple algorithm for secure domination in proper interval graphs
• A Theorem on Unit Segments on the Real Line
• Constructing numerical semigroups of a given genus.
• Counting numerical semigroups by genus and some cases of a question of Wilf.
• Gorenstein binomial edge ideals associated with scrolls
• Numerical semigroups with large embedding dimension satisfy Wilf's conjecture.
• ON DELTA SETS OF NUMERICAL MONOIDS
• Proper interval vertex deletion
• Sortable simplicial complexes and \(t\)-independence ideals of proper interval graphs
• Total Roman domination for proper interval graphs
• Unit interval graphs of open and closed intervals
• Unit interval orders and the dot action on the cohomology of regular semisimple Hessenberg varieties

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045920)