On the complexity of testing a graph for n-cube
type: Item
instance of: scholarly article
title: On the complexity of testing a graph for n-cube
zbMATH Open document ID: 0448.68016
DOI: 10.1016/0020-0190(80)90025-3
author: Kabekode V. S. Bhat
published in: Information Processing Letters
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3702104
zbMATH Keywords: n-cube characterization
zbMATH Keywords: efficient algorithm
MaRDI profile type: Publication
full work available at URL: 0020-0190(80)90025-3
OpenAlex ID: W2084394484
cites work: On the Addressing Problem for Loop Switching
cites work: Q5532258
cites work: Distance-preserving subgraphs of hypercubes
cites work: On cubical graphs
cites work: A characterization of hypercubes
cites work: \((0,\lambda)\)-graphs and \(n\)-cubes
cites work: n‐cubes and median graphs
cites work: Strongly graceful graphs
cites work: Bounds on the number of Hamiltonian circuits in the n-cube
cites work: An Appraisal of Some Shortest-Path Algorithms
cites work: Parallel concepts in graph theory
cites work: Q4773298
description: scientific article; zbMATH DE number 3702104