scientific article; zbMATH DE number 2044937

MaRDI QIDQ4448760zbMATH OpenFDO

Authors Cyril Gavoille, Éric Sopena, David Peleg, André Raspaud

Publication date 18 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2204/22040201.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Domination in planar graphs with small diameter*
• Domination numbers of planar graphs
• A distributed algorithm for \(k\)-dominating sets
• scientific article; zbMATH DE number 1617251
• A note on distance domination numbers of graphs

Cited in

(11)

• The degree/diameter problem in maximal planar bipartite graphs
• The degree/diameter problem in maximal planar bipartite graphs
• On covering bridged plane triangulations with balls
• Covering nearly surface-embedded graphs with a fixed number of balls
• Augmenting outerplanar graphs to meet diameter requirements
• Problems from CGCS Luminy, May 2007
• Power domination in planar graphs with small diameter
• The degree-diameter problem for sparse graph classes
• New bounds for multi-label interval routing
• On dominating sets whose induced subgraphs have a bounded diameter
• VC-dimension and Erdős-Pósa property

This page was built for publication:

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