Decomposition of Complete Bipartite Even Graphs into Closed Trails
From MaRDI portal
Cites work
Cited in
(17)- Sparse graphs which decompose into closed trails of arbitrary lengths
- Arbitrary decompositions into open and closed trails
- Decompositions of pseudographs into closed trails of even sizes
- On arbitrarily vertex decomposable trees
- On planar graphs arbitrarily decomposable into closed trails
- Decomposing complete multipartite graphs into closed trails of arbitrary even lengths
- scientific article; zbMATH DE number 5917766 (Why is no real title available?)
- Decomposition of bipartite graphs into closed trails
- Decomposition of complete bipartite graphs into open trails
- Closed trail decompositions of complete equipartite graphs
- scientific article; zbMATH DE number 5177321 (Why is no real title available?)
- Decomposing complete tripartite graphs into closed trails of arbitrary lengths
- Partitioning powers of traceable or Hamiltonian graphs
- Odd decompositions of Eulerian graphs
- Decomposition of complete bipartite digraphs and even complete multigraphs into closed trails
- Decomposing complete equipartite graphs into closed trails of length \(k\)
- Edge-disjoint open trails in complete bipartite multigraphs
This page was built for publication: Decomposition of Complete Bipartite Even Graphs into Closed Trails
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4802830)