Minimization of span in L(3,1)-labeling for a particular type of intersection graphs

DOI10.1007/978-3-031-35668-1_10MaRDI QIDQ6608601zbMATH OpenFDO

Authors Jasminara Khatun, Sk Amanathulla, Sheng-Lung Peng

Publication date 20 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-35668-1_10

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• L(0,1)-labelling of permutation graphs
• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
• \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
• L(3,2,1)-labeling problems on trapezoid graphs
• A bound on the chromatic number of the square of a planar graph
• Approximations for  -Colorings of Graphs
• Coloring the square of a planar graph
• scientific article; zbMATH DE number 1185300 (Why is no real title available?)
• scientific article; zbMATH DE number 7009474 (Why is no real title available?)
• Labelling Graphs with a Condition at Distance 2
• On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
• On the \(L(p,1)\)-labelling of graphs
• Selection of programme slots of television channels for giving advertisement: a graph theoretic approach

This page was built for publication: Minimization of span in \(L(3,1)\)-labeling for a particular type of intersection graphs

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