L(2, 1)-labelings of the edge-path-replacement of a graph

DOI10.1007/S10878-012-9470-2MaRDI QIDQ2392735zbMATHOpenAlexFDO

Authors Lü Damei

Publication date 2 August 2013

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9470-2

zbMATH Keywords

channel assignment\((d,1)\)-total labeling\(L(j,k)\)-labeling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• \(L(d,1)\)-labelings of the edge-path-replacement of a graph
• \(L(2, 1)\)-edge-labelings of the edge-path-replacement of a graph
• \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph
• \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
• \(L(d,1)\)-edge-labelings of the edge-path-replacement of a graph.

Cites work

• scientific article; zbMATH DE number 1185300 (Why is no real title available?)
• scientific article; zbMATH DE number 1754616 (Why is no real title available?)
• scientific article; zbMATH DE number 1792593 (Why is no real title available?)
• Labeling products of complete graphs with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• List edge and list total colourings of multigraphs
• On Total Chromatic Number of a Graph
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• On labeling the vertices of products of complete graphs with distance constraints
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• On the total coloring of certain graphs
• On unavoidability of trees with \(k\) leaves
• Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
• Optimal \(L(2,1)\)-labeling of Cartesian products of cycles, with an application to independent domination
• Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
• Total colorings of planar graphs with large maximum degree
• Total colourings of planar graphs with large girth
• \((p,1)\)-total labelling of graphs
• \(L(2,1)\)-labeling of direct product of paths and cycles
• \(L(2,1)\)-labelings of Cartesian products of two cycles

Cited in

(13)

• \(L(2, 1)\)-edge-labelings of the edge-path-replacement of a graph
• \(L(j,k)\)-labelings and \(L(j,k)\)-edge-labelings of graphs.
• \(L(2,1)\)-labelings of subdivisions of graphs
• \(L(2,1)\)-labelings of the local-edge-path-replacements of Cartesian products
• \( L ( p , q )\)-labelings of subdivisions of graphs
• \(L(d,1)\)-labelings of the edge-path-replacement of a graph
• \(L(d,1)\)-edge-labelings of the edge-path-replacement of a graph.
• Exact square coloring of graphs resulting from some graph operations and products
• scientific article; zbMATH DE number 7144805 (Why is no real title available?)
• scientific article; zbMATH DE number 6770085 (Why is no real title available?)
• On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
• \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
• \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph

This page was built for publication: \(L(2, 1)\)-labelings of the edge-path-replacement of a graph

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