Cycles and paths in edge-colored graphs with given degrees

A. Abouelaoualim; K. Ch Das; W. Fernandez De La Vega; M. Karpinski; Y. Manoussakis; C. A. Martinhon; R. Saad

doi:10.1002/jgt.20440

Cycles and paths in edge-colored graphs with given degrees

A. Abouelaoualim
, K. Ch Das
, W. Fernandez De La Vega
, M. Karpinski
, Y. Manoussakis
, C. A. Martinhon
, R. Saad

University of Paris 11
University of Bonn
Universidade Federal Fluminense
Collège militaire royal de Saint-Jean

Research output: Contribution to journal › Article › peer-review

21 Scopus citations

Abstract

Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are investigated. In particular, we prove that an edgecolored multigraph of order n on at least three colors and with minimum

Original language	English
Pages (from-to)	63-86
Number of pages	24
Journal	Journal of Graph Theory
Volume	64
Issue number	1
DOIs	https://doi.org/10.1002/jgt.20440
State	Published - May 2010
Externally published	Yes

Keywords

Cycle
Edge-colored graph
Hamiltonian
Path
Properly edge-colored

Access to Document

10.1002/jgt.20440

Cite this

@article{6c14be5e66af4016b64bb10b2e3a68e7,

title = "Cycles and paths in edge-colored graphs with given degrees",

abstract = "Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are investigated. In particular, we prove that an edgecolored multigraph of order n on at least three colors and with minimum",

keywords = "Cycle, Edge-colored graph, Hamiltonian, Path, Properly edge-colored",

author = "A. Abouelaoualim and Das, \{K. Ch\} and \{Fernandez De La Vega\}, W. and M. Karpinski and Y. Manoussakis and Martinhon, \{C. A.\} and R. Saad",

year = "2010",

month = may,

doi = "10.1002/jgt.20440",

language = "English",

volume = "64",

pages = "63--86",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "1",

}

TY - JOUR

T1 - Cycles and paths in edge-colored graphs with given degrees

AU - Abouelaoualim, A.

AU - Das, K. Ch

AU - Fernandez De La Vega, W.

AU - Karpinski, M.

AU - Manoussakis, Y.

AU - Martinhon, C. A.

AU - Saad, R.

PY - 2010/5

Y1 - 2010/5

N2 - Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are investigated. In particular, we prove that an edgecolored multigraph of order n on at least three colors and with minimum

AB - Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are investigated. In particular, we prove that an edgecolored multigraph of order n on at least three colors and with minimum

KW - Cycle

KW - Edge-colored graph

KW - Hamiltonian

KW - Path

KW - Properly edge-colored

UR - https://www.scopus.com/pages/publications/77953108434

U2 - 10.1002/jgt.20440

DO - 10.1002/jgt.20440

M3 - Article

AN - SCOPUS:77953108434

SN - 0364-9024

VL - 64

SP - 63

EP - 86

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 1

ER -

Cycles and paths in edge-colored graphs with given degrees

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this