Pages that link to "Item:Q2333163"

The following pages link to The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163):

Displaying 10 items.

• On the \(k\)-path vertex cover of some graph products (Q1759813) (← links)
• Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
• On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
• A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (Q2192977) (← links)
• Strong geodetic cores and Cartesian product graphs (Q2286132) (← links)
• The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
• On the vertex \(k\)-path cover (Q2446837) (← links)
• The Cover Time of Cartesian Product Graphs (Q3000524) (← links)
• 3-path vertex cover and dissociation number of hexagonal graphs (Q5866250) (← links)
• The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)