scientific article; zbMATH DE number 3517192

zbMATH Open0331.05116MaRDI QIDQ4097319FDOQ4097319

Authors: Zdzisław Skupień 

Publication date: 1975

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cited In (7)

• The approximability of the weighted Hamiltonian path completion problem on a tree
• Optimal path cover problem on block graphs
• A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
• On a class of posets and the corresponding comparability graphs
• Path partition number in tough graphs
• Scattering number and modular decomposition
• Algorithms for solving problems on graphs of bounded pathwidth

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