scientific article; zbMATH DE number 3465355

zbMATH Open0297.05134MaRDI QIDQ4050641FDOQ4050641

Authors S. Goodman, Stephen T. Hedetniemi

Publication date 1974

Mathematics Subject Classification ID

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

Cited in

(19)

• Complexity and computation of connected zero forcing
• A linear algorithm for the Hamiltonian completion number of a tree
• Parameterizing path partitions
• 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
• \(T\)-colorings of graphs: recent results and open problems
• Evolving test instances of the Hamiltonian completion problem
• Finding a minimum path cover of a distance-hereditary graph in polynomial time
• Optimal covering of cacti by vertex-disjoint paths
• Conditions for graphs to be path partition optimal
• Linear algorithm for optimal path cover problem on interval graphs
• Parameterizing path partitions
• A linear algorithm for the Hamiltonian completion number of the line graph of a tree
• The formula for Turán number of spanning linear forests
• On the \(k\)-path partition of graphs.
• The Turán number for spanning linear forests
• Path covering number and \(L(2,1)\)-labeling number of graphs
• The total interval number of a tree and the Hamiltonian completion number of its line graph

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 Q4050641)