Pages that link to "Item:Q1342260"
From MaRDI portal
The following pages link to The path-partition problem in block graphs (Q1342260):
Displaying 11 items.
- Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← links)
- \(k\)-path partitions in trees (Q1377668) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178) (← links)
- Path partition for graphs with special blocks (Q1765521) (← links)
- Corrigendum to ``The path-partition problem in block graphs''. (Q1853086) (← links)
- Optimal path cover problem on block graphs (Q1960660) (← links)
- On the \(k\)-path cover problem for cacti (Q2369003) (← links)
- Path covering number and \(L(2,1)\)-labeling number of graphs (Q2446849) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
