scientific article; zbMATH DE number 3467157
From MaRDI portal
Publication:4052166
Cited in
(24)- The approximability of the weighted Hamiltonian path completion problem on a tree
- Hamiltonian completions of sparse random graphs
- Jump number maximization for proper interval graphs and series-parallel graphs
- Path covering number and \(L(2,1)\)-labeling number of graphs
- A linear algorithm for the Hamiltonian completion number of a tree
- On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
- On island sequences of labelings with a condition at distance two
- Differential approximation results for the traveling salesman and related problems
- Optimal covering of cacti by vertex-disjoint paths
- Linear algorithm for optimal path cover problem on interval graphs
- Graph theory (algorithmic, algebraic, and metric problems)
- \(T\)-colorings of graphs: recent results and open problems
- Connected certified domination edge critical and stable graphs
- Relating path coverings to vertex labellings with a condition at distance two
- Path coverings of the vertices of a tree
- On mapping processes to processors in distributed systems
- Complexity and computation of connected zero forcing
- On finding the best and worst orientations for the metric dimension
- Parameterizing path partitions
- On the \(k\)-path cover problem for cacti
- Path covering problems and testing of printed circuits
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
- The total interval number of a tree and the Hamiltonian completion number of its line graph
- A linear algorithm for the number of degree constrained subforests of a tree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4052166)
