Pages that link to "Item:Q1960660"

The following pages link to Optimal path cover problem on block graphs (Q1960660):

Displaying 15 items.

• Optimal vertex ranking of block graphs (Q958305) (← links)
• The pos/neg-weighted median problem on block graphs with subgraph-shaped customers (Q985733) (← 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)
• Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability (Q2384537) (← 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)
• Node-searching problem on block graphs (Q2462351) (← 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)
• On the dominator coloring in proper interval graphs and block graphs (Q2788718) (← links)
• (Q4691777) (← links)
• On the path partition number of 6‐regular graphs (Q6057632) (← links)