A new characterization of disk graphs and its application.

MaRDI QIDQ2829061zbMATH OpenFDO

Authors Zhendong Shao, Roberto Solis-Oba

Publication date 26 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

disk graphfrequency assignmentunit disk graph\(L(2,1)\)-labeling

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Approximation and Online Algorithms
• Generalized disk graphs
• Disk embeddings of planar graphs
• scientific article; zbMATH DE number 2235058
• The number of disk graphs
• Asymptotic dimension and the disk graph I
• Better Approximation Schemes for Disk Graphs
• scientific article; zbMATH DE number 4031751
• On the Geršgorin disks of distance matrices of graphs
• Representing graphs by disks and balls (a survey of recognition-complexity results)

Cited in

(7)

• An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs
• The MST of symmetric disk graphs is light
• Representing graphs by disks and balls (a survey of recognition-complexity results)
• scientific article; zbMATH DE number 1877050 (Why is no real title available?)
• \( L ( 2 , 1 )\)-labeling of disk intersection graphs
• scientific article; zbMATH DE number 7692362 (Why is no real title available?)
• On distance constrained labeling of disk graphs

This page was built for publication: A new characterization of disk graphs and its application.

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