\(L(2, 1)\)-labelings of the edge-path-replacement of a graph
From MaRDI portal
Publication:2392735
DOI10.1007/s10878-012-9470-2zbMath1275.90115MaRDI QIDQ2392735
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
Related Items
L(2,1)-Edge-Labelings of the Edge-Path-Replacement of a Graph, Exact square coloring of graphs resulting from some graph operations and products, \(L(d,1)\)-labelings of the edge-path-replacement of a graph, \(L(2,1)\)-labelings of subdivisions of graphs, On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs, \( L ( p , q )\)-labelings of subdivisions of graphs
Cites Work
- Unnamed Item
- 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
- \((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
- 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
