Optimal Indexing of the Vertices of Graphs

DOI10.2307/2005704zbMATH Open0295.05117OpenAlexW4229789029MaRDI QIDQ4047569FDOQ4047569

Authors: Carl H. FitzGerald 

Publication date: 1974

Full work available at URL: https://doi.org/10.2307/2005704

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12)

Cites Work

• Complexity Bounds for Regular Finite Difference and Finite Element Grids

Cited In (5)

• Bandwidth and pathwidth of three-dimensional grids
• Antibandwidth of Three-Dimensional Meshes
• Treewidth of Cartesian products of highly connected graphs
• Antibandwidth of three-dimensional meshes
• Optimal embedding of 2-D torus into ring

This page was built for publication: Optimal Indexing of the Vertices of Graphs

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