scientific article

zbMath0297.05134MaRDI QIDQ4050641

S. Goodman, Stephen T. Hedetniemi

Publication date: 1974

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (19)

The formula for Turán number of spanning linear forests ⋮ Parameterizing path partitions ⋮ On the \(k\)-path partition of graphs. ⋮ Linear algorithm for optimal path cover problem on interval graphs ⋮ Conditions for graphs to be path partition optimal ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ The Turán number for spanning linear forests ⋮ Parameterizing path partitions ⋮ Optimal covering of cacti by vertex-disjoint paths ⋮ Finding a minimum path cover of a distance-hereditary graph in polynomial time ⋮ \(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 ⋮ 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) ⋮ Augmenting trees so that every three vertices lie on a cycle ⋮ The approximability of the weighted Hamiltonian path completion problem on a tree ⋮ Evolving test instances of the Hamiltonian completion problem ⋮ A linear algorithm for the Hamiltonian completion number of the line graph of a tree

This page was built for publication: