Pages that link to "Item:Q4489491"
From MaRDI portal
The following pages link to Partitions of a graph into paths with prescribed endvertices and lengths (Q4489491):
Displaying 13 items.
- Note on semi-linkage with almost prescribed lengths in large graphs (Q293607) (← links)
- Note on Enomoto and Ota's conjecture for short paths in large graphs (Q489313) (← links)
- On partitioning the edge set of a graph into internally disjoint paths without exterior vertices (Q659668) (← links)
- Path partitions of hypercubes (Q975503) (← links)
- Graph partition into paths containing specified vertices (Q1598832) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Enomoto and Ota's conjecture holds for large graphs (Q1756124) (← links)
- Partitioning graphs into paths or cycles of prescribed lengths (Q1937351) (← links)
- Graph decompositions and \(D_3\)-paths with a prescribed endvertex (Q1970703) (← links)
- Degree sum conditions for path-factors with specified end vertices in bipartite graphs (Q2374163) (← links)
- An asymptotic version of a conjecture by Enomoto and Ota (Q3055903) (← links)
- On the path partition of graphs (Q6137690) (← links)
- Paired 2-disjoint path covers of burnt pancake graphs with faulty elements (Q6138830) (← links)
