A new characterization of disk graphs and its application.

zbMATH Open1413.05344MaRDI QIDQ2829061FDOQ2829061

Authors: Zhendong Shao, Roberto Solis-Oba 

Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

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)

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)

Cited In (5)

• Representing graphs by disks and balls (a survey of recognition-complexity results)
• The MST of symmetric disk graphs is light
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)