The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle

Simple item page
dc.contributor.authorBenkouar, A.
dc.contributor.authorManoussakis, Y.
dc.contributor.authorSaad, R.
dc.date.accessioned2015-09-21T10:02:01Z
dc.date.available2015-09-21T10:02:01Z
dc.date.issued2003
dc.description.abstractLet G be a 2-edge-colored complete graph of even order n. A cycle of G is alternating if any two successive edges differ in color. We prove that there is a one-to-one correspondence between the set of bipartite tournaments of order n admitting a unique hamiltonian cycle and the set of 2-edge-colored complete graphs of order n admitting a unique alternating hamiltonian cycle. © 2002 Elsevier Science B.V. All rights reserveden_US
dc.identifier.issn0012365X
dc.identifier.urihttps://dspace.univ-boumerdes.dz/handle/123456789/2230
dc.language.isoenen_US
dc.publisherDiscrete Mathematicsen_US
dc.relation.ispartofseriesVolume 263, Issue 1-3, 28 February 2003;PP. 1-10
dc.subjectAlternating cyclesen_US
dc.subjectComplete graphsen_US
dc.subjectHamiltonian cyclesen_US
dc.titleThe number of 2-edge-colored complete graphs with unique hamiltonian alternating cycleen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle.pdf
Size:
89.39 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Publications Internationales