Optimal labelling of unit interval graphs

DOI10.1007/BF02662875zbMATH Open0840.05082MaRDI QIDQ1906576FDOQ1906576

Authors: Jinjiang Yuan, Sanming Zhou 

Publication date: 4 July 1996

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Recommendations

• On distance two labelling of unit interval graphs
• scientific article; zbMATH DE number 4070955
• scientific article; zbMATH DE number 7081025
• scientific article; zbMATH DE number 4075107
• Optimal distance labeling for interval and circular-arc graphs

zbMATH Keywords

bandwidthcutwidthunit interval graphbandwidth sumlabellingscyclic bandwith

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Triangulated graphs and the elimination process
• Computing the Minimum Fill-In is NP-Complete
• Topological Bandwidth
• Title not available (Why is that?)
• Profile minimization problem for matrices and graphs

Cited In (9)

• Lower and upper bounds for the linear arrangement problem on interval graphs
• Embedding ray intersection graphs and global curve simplification
• Tabu search for the cyclic bandwidth problem
• On cutwidth parameterized by vertex cover
• On cutwidth parameterized by vertex cover
• Semi-proper interval graphs
• Efficient iterated greedy for the two-dimensional bandwidth minimization problem
• Computing the cutwidth of bipartite permutation graphs in linear time
• Maximum cut on interval graphs of interval count four is NP-complete

This page was built for publication: Optimal labelling of unit interval graphs

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