\(L(d,1)\)-labelings of the edge-path-replacement of a graph
From MaRDI portal
Publication:386438
DOI10.1007/s10878-012-9487-6zbMath1282.90218OpenAlexW2077288023MaRDI QIDQ386438
Publication date: 9 December 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9487-6
Related Items (4)
\( L ( p , q )\)-labelings of subdivisions of graphs ⋮ \(L(2,1)\)-labelings of subdivisions of graphs ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List edge and list total colourings of multigraphs
- Total colourings of planar graphs with large girth
- On unavoidability of trees with \(k\) leaves
- \(L(2,1)\)-labeling of direct product of paths and cycles
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- \(L(2, 1)\)-labelings of the edge-path-replacement of a graph
- \((p,1)\)-total labelling of graphs
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- On the total coloring of certain graphs
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
- Labelling Graphs with a Condition at Distance 2
- Total colorings of planar graphs with large maximum degree
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
- On labeling the vertices of products of complete graphs with distance constraints
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- On Total Chromatic Number of a Graph
This page was built for publication: \(L(d,1)\)-labelings of the edge-path-replacement of a graph
