Decomposition of complete bipartite even graphs into closed trails

Mirko Horňák; Mariusz Woźniak

Czechoslovak Mathematical Journal (2003)

  • Volume: 53, Issue: 1, page 127-134
  • ISSN: 0011-4642

Abstract

top
We prove that any complete bipartite graph K a , b , where a , b are even integers, can be decomposed into closed trails with prescribed even lengths.

How to cite

top

Horňák, Mirko, and Woźniak, Mariusz. "Decomposition of complete bipartite even graphs into closed trails." Czechoslovak Mathematical Journal 53.1 (2003): 127-134. <http://eudml.org/doc/30764>.

@article{Horňák2003,
abstract = {We prove that any complete bipartite graph $K_\{a,b\}$, where $a,b$ are even integers, can be decomposed into closed trails with prescribed even lengths.},
author = {Horňák, Mirko, Woźniak, Mariusz},
journal = {Czechoslovak Mathematical Journal},
keywords = {complete bipartite graph; closed trail; arbitrarily decomposable graph; complete bipartite graph; closed trail; arbitrarily decomposable graph},
language = {eng},
number = {1},
pages = {127-134},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Decomposition of complete bipartite even graphs into closed trails},
url = {http://eudml.org/doc/30764},
volume = {53},
year = {2003},
}

TY - JOUR
AU - Horňák, Mirko
AU - Woźniak, Mariusz
TI - Decomposition of complete bipartite even graphs into closed trails
JO - Czechoslovak Mathematical Journal
PY - 2003
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 53
IS - 1
SP - 127
EP - 134
AB - We prove that any complete bipartite graph $K_{a,b}$, where $a,b$ are even integers, can be decomposed into closed trails with prescribed even lengths.
LA - eng
KW - complete bipartite graph; closed trail; arbitrarily decomposable graph; complete bipartite graph; closed trail; arbitrarily decomposable graph
UR - http://eudml.org/doc/30764
ER -

References

top
  1. Packing circuits into K n , (to appear). (to appear) Zbl1113.05309
  2. 10.1016/S0012-365X(01)00287-4, Discrete Math. 252 (2002), 17–29. (2002) MR1907743DOI10.1016/S0012-365X(01)00287-4
  3. Balanced edge colorings, Manuscript, 1999, pp. 16. (1999) MR2041315
  4. 10.1006/jctb.1998.1884, J.  Combin. Theory Ser. B 75 (1999), 288–301. (1999) MR1676894DOI10.1006/jctb.1998.1884
  5. 10.1002/(SICI)1097-0118(199710)26:2<73::AID-JGT2>3.0.CO;2-C, J.  Graph Theory 26 (1997), 73–82. (1997) MR1469354DOI10.1002/(SICI)1097-0118(199710)26:2<73::AID-JGT2>3.0.CO;2-C
  6. Observability of a graph, Math. Slovaca 46 (1996), 21–31. (1996) MR1414406

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.