A new characterization of disk graphs and its application.

zbMATH Open1413.05344MaRDI QIDQ2829061FDOQ2829061

Roberto Solis-Oba, Zhendong Shao

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)

Cited In (4)

• 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?)

   Recommendations

• Approximation and Online Algorithms 👍 👎
• Generalized disk graphs 👍 👎
• Disk embeddings of planar graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• The number of disk graphs 👍 👎
• Asymptotic dimension and the disk graph I 👍 👎
• Better Approximation Schemes for Disk Graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Representing graphs by disks and balls (a survey of recognition-complexity results) 👍 👎

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)