Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers

DOI10.1007/s10878-013-9610-3zbMath1338.90428OpenAlexW2015267805MaRDI QIDQ2253966

Nianfeng Lin, Dan Yi, Damei Lü, Juan Du, Ke Zhang

Publication date: 16 February 2015

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

Full work available at URL: https://doi.org/10.1007/s10878-013-9610-3

zbMATH Keywords

path covering number\(L(2Nordhaus-Gaddum-type result1)\)-labeling number

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relating path coverings to vertex labellings with a condition at distance two
• \(L(h,1)\)-labeling subclasses of planar graphs
• A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type
• Labeling Products of Complete Graphs with a Condition at Distance Two
• On Complementary Graphs
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• Labeling trees with a condition at distance two