Partial and perfect path covers of cographs

DOI10.1016/S0166-218X(98)00101-2MaRDI QIDQ1281391zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 17 August 1999

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(98)00101-2

zbMATH Keywords

algorithmcographpath cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Partial covers of graphs
• An optimal path cover algorithm for cographs
• Publication:4892000
• Acyclic graphoidal covers and path partitions in a graph
• Perfect path double covers of graphs
• scientific article; zbMATH DE number 7308162
• On total covers of graphs
• On covers of graphs
• On covers of graphs
• scientific article; zbMATH DE number 1334640

Cites work

• A linear algorithm for a core of a tree
• A Linear Recognition Algorithm for Cographs
• A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs
• An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Clustering and domination in perfect graphs
• Complement reducible graphs
• Finding a Longest Path in a Complete Multipartite Digraph
• Finding the two-core of a tree
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3920497 (Why is no real title available?)
• scientific article; zbMATH DE number 3735873 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Linear algorithm for optimal path cover problem on interval graphs
• Monadic second-order evaluations on tree-decomposable graphs
• On approximating the longest path in a graph
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• The Pathwidth and Treewidth of Cographs

Cited in

(6)

• A time-optimal solution for the path cover problem on cographs.
• Acyclic graphoidal covers and path partitions in a graph
• An optimal path cover algorithm for cographs
• The existence of path-factor covered graphs
• Perfect path double covers of graphs
• scientific article; zbMATH DE number 5592867 (Why is no real title available?)

This page was built for publication: Partial and perfect path covers of cographs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1281391)