Repeated edges in 2‐factorizations

Charles Colbourn, Alexander Rosa

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

The spectrum of numbers of repeated edges in 2‐factorizations of 2Kn is determined for all n. The techniques employed are direct, using isomorphic factorizations of Kn, and closely related factorizations.

Original languageEnglish (US)
Pages (from-to)5-24
Number of pages20
JournalJournal of Graph Theory
Volume14
Issue number1
DOIs
StatePublished - 1990
Externally publishedYes

Fingerprint

Factorization
Isomorphic

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Repeated edges in 2‐factorizations. / Colbourn, Charles; Rosa, Alexander.

In: Journal of Graph Theory, Vol. 14, No. 1, 1990, p. 5-24.

Research output: Contribution to journalArticle

Colbourn, Charles ; Rosa, Alexander. / Repeated edges in 2‐factorizations. In: Journal of Graph Theory. 1990 ; Vol. 14, No. 1. pp. 5-24.
@article{b374f53612c444378c9bc3663c878dc0,
title = "Repeated edges in 2‐factorizations",
abstract = "The spectrum of numbers of repeated edges in 2‐factorizations of 2Kn is determined for all n. The techniques employed are direct, using isomorphic factorizations of Kn, and closely related factorizations.",
author = "Charles Colbourn and Alexander Rosa",
year = "1990",
doi = "10.1002/jgt.3190140103",
language = "English (US)",
volume = "14",
pages = "5--24",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - Repeated edges in 2‐factorizations

AU - Colbourn, Charles

AU - Rosa, Alexander

PY - 1990

Y1 - 1990

N2 - The spectrum of numbers of repeated edges in 2‐factorizations of 2Kn is determined for all n. The techniques employed are direct, using isomorphic factorizations of Kn, and closely related factorizations.

AB - The spectrum of numbers of repeated edges in 2‐factorizations of 2Kn is determined for all n. The techniques employed are direct, using isomorphic factorizations of Kn, and closely related factorizations.

UR - http://www.scopus.com/inward/record.url?scp=84986516350&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84986516350&partnerID=8YFLogxK

U2 - 10.1002/jgt.3190140103

DO - 10.1002/jgt.3190140103

M3 - Article

AN - SCOPUS:84986516350

VL - 14

SP - 5

EP - 24

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 1

ER -