Optimal Indexing of the Vertices of Graphs

DOI10.2307/2005704zbMath0295.05117OpenAlexW4229789029MaRDI QIDQ4047569

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)

Related Items (5)

Treewidth of Cartesian Products of Highly Connected Graphs ⋮ Optimal embedding of 2-D torus into ring ⋮ Antibandwidth of three-dimensional meshes ⋮ Bandwidth and pathwidth of three-dimensional grids ⋮ Antibandwidth of Three-Dimensional Meshes

Cites Work

• Complexity Bounds for Regular Finite Difference and Finite Element Grids

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