The ^2-conjecture for L(2,1)-labelings is true for total graphs
From MaRDI portal
Publication:548395
DOI10.1016/J.AML.2011.03.028zbMATH Open1218.05167OpenAlexW79397878WikidataQ123231747 ScholiaQ123231747MaRDI QIDQ548395FDOQ548395
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
Recommendations
Cites Work
- \(T\)-colorings of graphs: recent results and open problems
- No-hole \(L(2,1)\)-colorings
- The \(L(2,1)\)-labelling of trees
- Labelling Graphs with a Condition at Distance 2
- Parallel concepts in graph theory
- A survey on labeling graphs with a condition at distance two
- Graph labeling and radio channel assignment
- Coloring the square of a planar graph
- The $L(2,1)$-Labeling Problem on Graphs
- On \((d,1)\)-total numbers of graphs
- The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
- On the \(L(p,1)\)-labelling of graphs
- Title not available (Why is that?)
- Labeling Chordal Graphs: Distance Two Condition
- The L(2,1)-labeling and operations of graphs
- The \(L(2,1)\)-labeling on planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
- On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs
- The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
- The \(\Delta^2\) conjecture holds for graphs of small order
- \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs
- The \(L(2,1)\)-labeling on total graphs of complete multipartite graphs
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)
