A remark on a problem of Harary
From MaRDI portal
Publication:5596082
DOI10.21136/cmj.1970.100949zbMath0197.50203OpenAlexW2739333144MaRDI QIDQ5596082
Publication date: 1970
Full work available at URL: https://eudml.org/doc/12520
Related Items (21)
The bandwidth problem and operations on graphs ⋮ Enumerating the kernels of a directed graph with no odd circuits ⋮ A Result on the Strength of Graphs by Factorizations of Complete Graphs ⋮ The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\) ⋮ Harper-type lower bounds and the bandwidths of the compositions of graphs ⋮ Kernels in graphs with a clique-cutset ⋮ Lower bounds for the bandwidth problem ⋮ Complexity of problems in games, graphs and algebraic equations ⋮ Bandwidth of convex bipartite graphs and related graphs ⋮ Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete ⋮ Optimization Bounds from the Branching Dual ⋮ Bandwidth of graphs resulting from the edge clique covering problem ⋮ Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems ⋮ A branch and bound algorithm for the matrix bandwidth minimization ⋮ The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness ⋮ On bandwidth for the tensor product of paths and cycles ⋮ Optimal labelling of a product of two paths ⋮ Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998 ⋮ Perfect stables in graphs ⋮ Bounding the bandwidths for graphs ⋮ Bandwidths and profiles of trees
Cites Work
This page was built for publication: A remark on a problem of Harary
