Pages that link to "Item:Q1272711"

The following pages link to The path-partition problem in bipartite distance-hereditary graphs (Q1272711):

Displaying 12 items.

• On partitioning simple bipartite graphs in vertex-disjoint paths (Q925494) (← links)
• Linear \(k\)-arboricities on trees (Q1570841) (← links)
• Path partition for graphs with special blocks (Q1765521) (← links)
• A boundary class for the \(k\)-path partition problem (Q1791978) (← links)
• Recognition of probe distance-hereditary graphs (Q1932454) (← links)
• On the Galois lattice of bipartite distance hereditary graphs (Q2352777) (← links)
• Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
• The Hamiltonian problem on distance-hereditary graphs (Q2489947) (← links)
• Computing maximum stable sets for distance-hereditary graphs (Q2568337) (← links)
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
• (Q4691777) (← links)
• On the jump number problem in hereditary classes of bipartite graphs (Q5935840) (← links)