L(2,1)-labelings of subdivisions of graphs
From MaRDI portal
Publication:472974
DOI10.1016/J.DISC.2014.09.006zbMATH Open1303.05171OpenAlexW2002418538MaRDI QIDQ472974FDOQ472974
Authors: J. Herrera, Sumit K. Garg 
Publication date: 20 November 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.09.006
Recommendations
- \( L ( p , q )\)-labelings of subdivisions of graphs
- \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs
- scientific article; zbMATH DE number 2073985
- \(L(2,1)\)-labelings on the composition of \(n\) graphs
- \((2,1)\)-total labeling of a class of subcubic graphs
- \(L(3,2,1)\)-labeling of graphs
- \(L(2,1)\)-labeling in the context of some graph operations
- \(L(3,2,1)\)-labelling of graphs
- \(L(2,1)\)-labeling of graphs: known results and open problems
- scientific article; zbMATH DE number 2091962
Cites Work
- List edge and list total colourings of multigraphs
- Total colourings of planar graphs with large girth
- Total colourings of graphs
- On the total coloring of certain graphs
- Labelling Graphs with a Condition at Distance 2
- Total colorings of planar graphs with large maximum degree
- On Total Chromatic Number of a Graph
- A survey on labeling graphs with a condition at distance two
- The $L(2,1)$-Labeling Problem on Graphs
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
- \((2,1)\)-total labelling of outerplanar graphs
- \((p,1)\)-total labelling of graphs
- (d,1)-total labeling of graphs with a given maximum average degree
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- On \((d,1)\)-total numbers of graphs
- \(L(2, 1)\)-labelings of the edge-path-replacement of a graph
- \(L(d,1)\)-labelings of the edge-path-replacement of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- \( L ( p , q )\)-labelings of subdivisions of graphs
- Title not available (Why is that?)
- On the facets of the lift-and-project relaxations of graph subdivisions
- \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs
- Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph
- On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
This page was built for publication: \(L(2,1)\)-labelings of subdivisions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472974)
