Pages that link to "Item:Q4041608"

The following pages link to Hamiltonian circuits and path coverings of vertices in graphs (Q4041608):

Displaying 10 items.

• On a class of posets and the corresponding comparability graphs (Q1247984) (← links)
• Path coverings of the vertices of a tree (Q1251231) (← links)
• The path-partition problem in block graphs (Q1342260) (← links)
• Relating path coverings to vertex labellings with a condition at distance two (Q1343254) (← links)
• Path partition number in tough graphs (Q1356718) (← links)
• \(k\)-path partitions in trees (Q1377668) (← links)
• On the \(k\)-path partition of graphs. (Q1401225) (← links)
• Path partition for graphs with special blocks (Q1765521) (← links)
• Completion and deficiency problems (Q2200922) (← links)
• Hamiltonian path saturated graphs with small size (Q2492212) (← links)