# Perfect Set of Euler Tours of Kp,p,p

Discussiones Mathematicae Graph Theory (2016)

- Volume: 36, Issue: 4, page 783-796
- ISSN: 2083-5892

## Access Full Article

top## Abstract

top## How to cite

topT. Govindan, and A. Muthusamy. "Perfect Set of Euler Tours of Kp,p,p." Discussiones Mathematicae Graph Theory 36.4 (2016): 783-796. <http://eudml.org/doc/287108>.

@article{T2016,

abstract = {Bermond conjectured that if G is Hamilton cycle decomposable, then L(G), the line graph of G, is Hamilton cycle decomposable. In this paper, we construct a perfect set of Euler tours for the complete tripartite graph Kp,p,p for any prime p and hence prove Bermond’s conjecture for G = Kp,p,p.},

author = {T. Govindan, A. Muthusamy},

journal = {Discussiones Mathematicae Graph Theory},

keywords = {compatible Euler tour; line graph; Hamilton cycle decomposition},

language = {eng},

number = {4},

pages = {783-796},

title = {Perfect Set of Euler Tours of Kp,p,p},

url = {http://eudml.org/doc/287108},

volume = {36},

year = {2016},

}

TY - JOUR

AU - T. Govindan

AU - A. Muthusamy

TI - Perfect Set of Euler Tours of Kp,p,p

JO - Discussiones Mathematicae Graph Theory

PY - 2016

VL - 36

IS - 4

SP - 783

EP - 796

AB - Bermond conjectured that if G is Hamilton cycle decomposable, then L(G), the line graph of G, is Hamilton cycle decomposable. In this paper, we construct a perfect set of Euler tours for the complete tripartite graph Kp,p,p for any prime p and hence prove Bermond’s conjecture for G = Kp,p,p.

LA - eng

KW - compatible Euler tour; line graph; Hamilton cycle decomposition

UR - http://eudml.org/doc/287108

ER -

## NotesEmbed ?

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