Pages that link to "Item:Q1261472"

The following pages link to Optimal path cover problem on block graphs and bipartite permutation graphs (Q1261472):

Displaying 29 items.

• Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
• An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
• Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
• Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
• Linear algorithm for optimal path cover problem on interval graphs (Q911770) (← links)
• Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← links)
• Optimal covering of cacti by vertex-disjoint paths (Q1178689) (← links)
• Optimal path cover problem on block graphs and bipartite permutation graphs (Q1261472) (← links)
• The path-partition problem in block graphs (Q1342260) (← links)
• \(k\)-path partitions in trees (Q1377668) (← links)
• On the \(k\)-path partition of graphs. (Q1401225) (← 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)
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
• Optimal path cover problem on block graphs (Q1960660) (← links)
• Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
• A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
• On the \(k\)-path cover problem for cacti (Q2369003) (← links)
• Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
• Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251) (← 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)
• Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← 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)
• The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)
• (Q4691777) (← links)
• On the path partition number of 6‐regular graphs (Q6057632) (← links)