\(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs

DOI10.1007/s10878-013-9632-xzbMath1326.90095OpenAlexW2168444394MaRDI QIDQ2352348

Denise Sakai Troxell, Junjie Zhu, Jessica Oehrlein, Nathaniel J. Karst

Publication date: 1 July 2015

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

Full work available at URL: https://doi.org/10.1007/s10878-013-9632-x

zbMATH Keywords

\(L(2,1)\)-labelingedge-path-replacement\(L(d,1)\)-labeling\(L(d,1)\)-total labelingfactorization of graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Related Items

\( L ( p , q )\)-labelings of subdivisions of graphs, Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph, L(2,1)-Edge-Labelings of the Edge-Path-Replacement of a Graph, On a distance-constrained graph labeling to model cooperation, On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs, \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph

Cites Work

• Unnamed Item
• Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
• Group path covering and \(L(j,k)\)-labelings of diameter two graphs
• \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
• A note on \(L (2, 1)\)-labelling of trees
• Relating path coverings to vertex labellings with a condition at distance two
• On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
• Distance two edge labelings of lattices
• \((p,q)\)-total labeling of complete graphs
• Circular \(L(j,k)\)-labeling number of direct product of path and cycle
• \((p,1)\)-total labelling of graphs
• On the \(L(p,1)\)-labelling of graphs
• A survey on labeling graphs with a condition at distance two
• Griggs and Yeh's Conjecture and $L(p,1)$-labelings
• Labelling Graphs with a Condition at Distance 2
• L(2,1)-Edge-Labelings of the Edge-Path-Replacement of a Graph