scientific article
From MaRDI portal
Publication:4052166
zbMath0298.05133MaRDI QIDQ4052166
No author found.
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (23)
On the \(k\)-path cover problem for cacti ⋮ Differential approximation results for the traveling salesman and related problems ⋮ Relating path coverings to vertex labellings with a condition at distance two ⋮ On mapping processes to processors in distributed systems ⋮ Path covering problems and testing of printed circuits ⋮ Connected certified domination edge critical and stable graphs ⋮ On finding the best and worst orientations for the metric dimension ⋮ Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor ⋮ Linear algorithm for optimal path cover problem on interval graphs ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree ⋮ Optimal covering of cacti by vertex-disjoint paths ⋮ \(T\)-colorings of graphs: recent results and open problems ⋮ The total interval number of a tree and the Hamiltonian completion number of its line graph ⋮ On island sequences of labelings with a condition at distance two ⋮ Complexity and computation of connected zero forcing ⋮ A linear algorithm for the Hamiltonian completion number of a tree ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Path coverings of the vertices of a tree ⋮ Jump number maximization for proper interval graphs and series-parallel graphs ⋮ A linear algorithm for the number of degree constrained subforests of a tree ⋮ The approximability of the weighted Hamiltonian path completion problem on a tree ⋮ Hamiltonian completions of sparse random graphs
This page was built for publication:
