The ^2-conjecture for L(2,1)-labelings is true for total graphs

DOI10.1016/J.AML.2011.03.028MaRDI QIDQ548395zbMATH OpenOpenAlexWikidataFDO

Authors Ziming Duan, Pingli Lv, Cui-Qi Wang, Lianying Miao, Zhengke Miao

Publication date 28 June 2011

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2011.03.028

zbMATH Keywords

total graphfrequency assignment\(L(2,1)\)-labeling\(\Delta^2\)-conjecture

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 6940804
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
• scientific article; zbMATH DE number 5972537
• scientific article; zbMATH DE number 2091962
• scientific article; zbMATH DE number 2016729

Cites work

• scientific article; zbMATH DE number 1185300 (Why is no real title available?)
• scientific article; zbMATH DE number 2191985 (Why is no real title available?)
• scientific article; zbMATH DE number 2197903 (Why is no real title available?)
• A survey on labeling graphs with a condition at distance two
• Coloring the square of a planar graph
• Graph labeling and radio channel assignment
• Labeling Chordal Graphs: Distance Two Condition
• Labelling Graphs with a Condition at Distance 2
• No-hole \(L(2,1)\)-colorings
• On \((d,1)\)-total numbers of graphs
• On the \(L(p,1)\)-labelling of graphs
• Parallel concepts in graph theory
• The $L(2,1)$-Labeling Problem on Graphs
• The L(2,1)-labeling and operations of graphs
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
• The \(L(2,1)\)-labeling on planar graphs
• The \(L(2,1)\)-labelling of trees
• \(T\)-colorings of graphs: recent results and open problems

Cited in

(6)

• The \(L(2,1)\)-labeling on total graphs of complete multipartite graphs
• Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
• \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
• On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs
• The \(\Delta^2\) conjecture holds for graphs of small order

This page was built for publication: The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548395)