scientific article; zbMATH DE number 3465355

MaRDI QIDQ4050641zbMATH OpenFDO

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

(22)

• The approximability of the weighted Hamiltonian path completion problem on a tree
• Path covering number and \(L(2,1)\)-labeling number of graphs
• A linear algorithm for the Hamiltonian completion number of a tree
• Polynomial-time algorithms for \textsc{Path Cover} on trees and graphs of bounded treewidth
• Evolving test instances of the Hamiltonian completion problem
• 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
• Conditions for graphs to be path partition optimal
• The formula for Turán number of spanning linear forests
• A linear algorithm for the Hamiltonian completion number of the line graph of a tree
• Covering and partitioning of split, chain and cographs with isometric paths
• Finding a minimum path cover of a distance-hereditary graph in polynomial time
• Sum-of-max chain partition of a tree
• Complexity and computation of connected zero forcing
• The Turán number for spanning linear forests
• Parameterizing path partitions
• Parameterizing path partitions
• The total interval number of a tree and the Hamiltonian completion number of its line graph
• Augmenting trees so that every three vertices lie on a cycle
• On the \(k\)-path partition of graphs.

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)