On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs (Q2012895): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-016-0047-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2468184807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2,1)\)-labelings of subdivisions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-two labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-hole \(L(2,1)\)-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating path coverings to vertex labellings with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(L(p,1)\)-labelling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((p,1)\)-total labelling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On irreducible no‐hole <i>L</i>(2, 1)‐coloring of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2, 1)\)-labelings of the edge-path-replacement of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs / rank
 
Normal rank

Latest revision as of 05:48, 14 July 2024

scientific article
Language Label Description Also known as
English
On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
scientific article

    Statements

    Identifiers