On the L(h,k)-Labeling of Co-comparability Graphs

DOI10.1007/978-3-540-74450-4_11zbMATH Open1176.05071OpenAlexW1545279868MaRDI QIDQ3611902FDOQ3611902

Authors: Saverio Caminiti, Stephan Olariu, Rossella Petreschi, Tiziana Calamoneri 

Publication date: 3 March 2009

Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74450-4_11

Recommendations

• On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
• \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
• An efficient algorithm to solve \(L(0,1)\)-labelling problem on interval graphs
• \(L(2,1)\)-labeling of interval graphs
• The $L(2,1)$-Labeling Problem on Graphs

zbMATH Keywords

interval graphsco-comparability graphsunit-interval graphs\(L(h, k)\)-labeling

Mathematics Subject Classification ID

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

Cited In (4)

• \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
• Title not available (Why is that?)
• \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
• On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs

This page was built for publication: On the L(h,k)-Labeling of Co-comparability Graphs

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