Path partition for graphs with special blocks
From MaRDI portal
Publication:1765521
DOI10.1016/j.dam.2004.03.006zbMath1061.68122OpenAlexW2095499388MaRDI QIDQ1765521
Gerard Jennhwa Chang, Jun-Jie Pan
Publication date: 23 February 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2004.03.006
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Isometric-path numbers of block graphs
- Linear algorithm for optimal path cover problem on interval graphs
- Complement reducible graphs
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
- Paths in interval graphs and circular arc graphs
- On a class of posets and the corresponding comparability graphs
- Minimum node disjoint path covering for circular-arc graphs
- Optimal path cover problem on block graphs and bipartite permutation graphs
- The path-partition problem in bipartite distance-hereditary graphs
- Algorithmic aspects of linear \(k\)-arboricity
- The path-partition problem in block graphs
- \(k\)-path partitions in trees
- Corrigendum to ``The path-partition problem in block graphs.
- An optimal path cover algorithm for cographs
- HAMILTONian circuits in chordal bipartite graphs
- Optimal path cover problem on block graphs
- Hamiltonian circuits and path coverings of vertices in graphs
- The Planar Hamiltonian Circuit Problem is NP-Complete
- The $L(2,1)$-Labeling Problem on Graphs
This page was built for publication: Path partition for graphs with special blocks