Decomposition of Complete Bipartite Even Graphs into Closed Trails

DOI10.1023/A:1022931710349zbMath1010.05054OpenAlexW95137567MaRDI QIDQ4802830

Mariusz Woźniak, Mirko Horňák

Publication date: 23 April 2003

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/30764

zbMATH Keywords

complete bipartite graphclosed trailarbitrarily decomposable graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Decomposing complete multipartite graphs into closed trails of arbitrary even lengths, Decomposing complete equipartite graphs into closed trails of length \(k\), Edge-disjoint open trails in complete bipartite multigraphs, Partitioning powers of traceable or Hamiltonian graphs, Odd Decompositions of Eulerian Graphs, On arbitrarily vertex decomposable trees, Closed trail decompositions of complete equipartite graphs, On planar graphs arbitrarily decomposable into closed trails, Decomposition of bipartite graphs into closed trails, Decomposing complete tripartite graphs into closed trails of arbitrary lengths, 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, Decomposition of complete bipartite graphs into open trails

Cites Work

• On the vertex-distinguishing proper edge-colorings of graphs
• Balanced edge colorings.
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Packing Circuits into K_N
• Unnamed Item