\( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2019.08.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2974525455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graph recognition is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distance constrained labeling of disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / 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: On coloring unit disk 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: Griggs and Yeh's Conjecture and $L(p,1)$-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing graphs by disks and balls (a survey of recognition-complexity results) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sphere and dot product representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem about the Channel Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-colorings of graphs: recent results and open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: OVSF-CDMA code assignment in wireless ad hoc networks / rank
 
Normal rank

Latest revision as of 03:36, 22 July 2024

scientific article
Language Label Description Also known as
English
\( L ( 2 , 1 )\)-labeling of disk intersection graphs
scientific article

    Statements

    \( L ( 2 , 1 )\)-labeling of disk intersection graphs (English)
    0 references
    23 March 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    \( L ( 2, 1 )\)-labeling
    0 references
    0 references