Path covering number and $L(2,1)$-labeling number of graphs

DOI10.1016/j.dam.2013.02.020zbMath1286.05150arXiv1204.2306OpenAlexW97094275MaRDI QIDQ2446849

Publication date: 22 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.2306

zbMATH Keywords

path covering number $L(2, 1)$-labeling hole index

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (6)

Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ On the path partition of graphs ⋮ The minimum span of $L(2,1)$-labelings of generalized flowers ⋮ Unnamed Item ⋮ Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two ⋮ On $L(2 , 1)$-labelings of oriented graphs

Cites Work

Unnamed Item
Unnamed Item
Linear algorithm for optimal path cover problem on interval graphs
On island sequences of labelings with a condition at distance two
Optimal covering of cacti by vertex-disjoint paths
Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
Optimal chain partitions of trees
Path coverings of the vertices of a tree
Optimal path cover problem on block graphs and bipartite permutation graphs
The path-partition problem in block graphs
Relating path coverings to vertex labellings with a condition at distance two
No-hole $L(2,1)$-colorings
A note on collections of graphs with non-surjective lambda labelings
An optimal path cover algorithm for cographs
Optimal path cover problem on block graphs
Extremal problems on consecutive $L(2,1)$-labelling
An extremal problem on non-full colorable graphs
Finding a minimum path cover of a distance-hereditary graph in polynomial time
On the hole index of $L(2,1)$-labelings of $r$-regular graphs
A survey on labeling graphs with a condition at distance two
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
Full Color Theorems for L(2,1)-Colorings
Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings
Labelling Graphs with a Condition at Distance 2
Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
On Path Cover Problems in Digraphs and Applications to Program Testing
Graph labeling and radio channel assignment
Labeling Chordal Graphs: Distance Two Condition
On the $\lambda$-Number of $Q_n $ and Related Graphs
The $L(2,1)$-Labeling Problem on Graphs
On the Structure of Graphs with Non-Surjective L(2,1)-Labelings
Labelling Cayley Graphs on Abelian Groups

This page was built for publication: Path covering number and $L(2,1)$-labeling number of graphs

Path covering number and \(L(2,1)\)-labeling number of graphs