Counting disk graphs

MaRDI QIDQ2857418zbMATH OpenFDO

Authors Tobias Müller, Colin McDiarmid

Publication date 1 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065311001715

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• The number of disk graphs
• Generalized disk graphs
• scientific article; zbMATH DE number 1769307
• scientific article; zbMATH DE number 4031751
• Unit disk graphs
• scientific article; zbMATH DE number 4148119
• Counting over non-planar graphs
• scientific article; zbMATH DE number 3933107
• Graph theoretic counting problems
• Approximation and Online Algorithms

Cites work

• Lower Bounds for Approximation by Nonlinear Manifolds

Cited in

(7)

• Integer realizations of disk and segment graphs
• The number of disk graphs
• The number of bits needed to represent a unit disk graph
• Side disks of a spherical great polygon
• Recognizing a DOG is hard, but not when it is thin and unit
• scientific article; zbMATH DE number 7692362 (Why is no real title available?)
• On forbidden induced subgraphs for unit disk graphs

This page was built for publication: Counting disk graphs

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