The nomatic number problem in interval graphs

MaRDI QIDQ3519137zbMATH OpenFDO

Authors Sirous Ghobadi, N. D. Soner

Publication date 13 August 2008

Full work available at URL http://pphmj.com/abstract/3028.htm

zbMATH Keywords

degreeinterval graphlinear algorithmneighborhood setnomatic number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Neighbourhood sets in graphs
• The Domatic Number Problem in Interval Graphs
• Minimum line-neighbourhood set of an interval graph -- a linear time algorithm
• scientific article; zbMATH DE number 5663233
• scientific article; zbMATH DE number 861346

Cited in

(1)

• Minimum line-neighbourhood set of an interval graph -- a linear time algorithm

This page was built for publication: The nomatic number problem in interval graphs

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