Pages that link to "Item:Q1405105"
From MaRDI portal
The following pages link to Packing closed trails into dense graphs. (Q1405105):
Displaying 10 items.
- Partitioning powers of traceable or Hamiltonian graphs (Q391776) (← links)
- Sparse graphs which decompose into closed trails of arbitrary lengths (Q1015428) (← links)
- Decompositions of pseudographs into closed trails of even sizes (Q1044920) (← links)
- An asymptotic solution to the cycle decomposition problem for complete graphs (Q1957980) (← links)
- Decomposing dense bipartite graphs into 4-cycles (Q2260624) (← links)
- On arbitrarily vertex decomposable trees (Q2470004) (← links)
- On planar graphs arbitrarily decomposable into closed trails (Q2482349) (← links)
- Decomposition of bipartite graphs into closed trails (Q3070111) (← links)
- Decomposing complete tripartite graphs into closed trails of arbitrary lengths (Q3617969) (← links)
- Decomposing Graphs of High Minimum Degree into 4‐Cycles (Q5265328) (← links)
