Group path covering and distance two labeling of graphs
From MaRDI portal
Publication:1944096
DOI10.1016/j.ipl.2011.03.016zbMath1260.05141OpenAlexW1986709981MaRDI QIDQ1944096
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.016
bipartite graphcombinatorial problemspath covering\(L(d,1)\)-labeling\(L'(d,1)\)-labeling\(t\)-group path coveringlist labeling
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (1)
Cites Work
- Unnamed Item
- Graph coloring with cardinality constraints on the neighborhoods
- Relating path coverings to vertex labellings with a condition at distance two
- On \(L(d,1)\)-labelings of graphs
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- A survey on labeling graphs with a condition at distance two
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Labelling Graphs with a Condition at Distance 2
- Approximations for -Colorings of Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- Structural Information and Communication Complexity
- Hamiltonicity and circular distance two labellings
This page was built for publication: Group path covering and distance two labeling of graphs