Partial and perfect path covers of cographs
From MaRDI portal
Publication:1281391
DOI10.1016/S0166-218X(98)00101-2zbMath0918.05082OpenAlexW1996885092MaRDI QIDQ1281391
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
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monadic second-order evaluations on tree-decomposable graphs
- Linear algorithm for optimal path cover problem on interval graphs
- Clustering and domination in perfect graphs
- Finding the two-core of a tree
- Complement reducible graphs
- A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs
- A Linear Recognition Algorithm for Cographs
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A linear algorithm for a core of a tree
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
- The Pathwidth and Treewidth of Cographs
- Finding a Longest Path in a Complete Multipartite Digraph
- The $L(2,1)$-Labeling Problem on Graphs
- On approximating the longest path in a graph
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Partial and perfect path covers of cographs
