An efficient algorithm to solve L(0,1)-labelling problem on interval graphs

zbMATH Open1413.05339MaRDI QIDQ4614841FDOQ4614841

Anita Pal, Madhumangal Pal, Satyabrata Paul

Publication date: 31 January 2019

Full work available at URL: https://camo.ici.ro/journal/vol15/v15a3.pdf

Recommendations

• \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
• \(L(2,1)\)-labeling of interval graphs
• \(L(0,1)\)-labelling of permutation graphs
• On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
• Determining the \(L(2,1)\)-span in polynomial space

zbMATH Keywords

interval graphfrequency assignment\(L(0,1)\)-labelling

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (11)

• 0-1 labelling for network characterization
• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
• Exact square coloring of certain classes of graphs: complexity and algorithms
• An optimal algorithm to find minimum k-hop dominating set of interval graphs
• Deferred-query: An efficient approach for some problems on interval graphs
• Title not available (Why is that?)
• A linear time algorithm to compute square of interval graphs and their colouring
• \(L(2,1)\)-labeling of interval graphs
• \(L(0,1)\)-labelling of permutation graphs
• Exact square coloring of graphs resulting from some graph operations and products
• On the L(h,k)-Labeling of Co-comparability Graphs

This page was built for publication: An efficient algorithm to solve \(L(0,1)\)-labelling problem on interval graphs

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