Edge-disjoint spanners in Cartesian products of graphs

DOI10.1016/J.DISC.2005.04.004MaRDI QIDQ2487981zbMATH OpenOpenAlexFDO

Authors Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho

Publication date 17 August 2005

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2005.04.004

zbMATH Keywords

DistanceHypercubeSubgraph

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Edge-disjoint spanners in tori
• Edge-disjoint spanners of complete bipartite graphs
• Spanners of Hypercube-Derived Networks
• Edge-disjoint spanners of complete graphs and complete digraphs
• Grid spanners

Cites work

• Additive graph spanners
• An Optimal Synchronizer for the Hypercube
• Approximating theDomatic Number
• Degree-Constrained Network Spanners with Nonconstant Delay
• Degree-constrained spanners for multidimensional grids
• Edge-disjoint spanners of complete bipartite graphs
• Factor d-domatic colorings of graphs
• Generating Low-Degree 2-Spanners
• Generating Sparse 2-Spanners
• Graph spanners
• Grid spanners
• scientific article; zbMATH DE number 4173021 (Why is no real title available?)
• NEW SPARSENESS RESULTS ON GRAPH SPANNERS
• On sparse spanners of weighted graphs
• Spanners of Hypercube-Derived Networks

Cited in

(3)

• Edge-disjoint spanners in tori
• Edge-disjoint spanners of complete graphs and complete digraphs
• Edge-disjoint spanners of complete bipartite graphs

This page was built for publication: Edge-disjoint spanners in Cartesian products of graphs

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