Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs

Ruonan Li, Hajo Broersma (Corresponding Author), Shenggui Zhang

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
33 Downloads (Pure)

Abstract

With respect to specific cycle-related problems, edge-colored graphs can be considered as a generalization of directed graphs. We show that properly edge-colored theta graphs play a key role in characterizing the difference between edge-colored complete graphs and multipartite tournaments. We also establish sufficient conditions for an edge-colored complete graph to contain a small and a large properly edge-colored theta graph, respectively.
Original languageEnglish
Pages (from-to)261-286
Number of pages26
JournalGraphs and combinatorics
Volume35
Issue number1
DOIs
Publication statusPublished - 2 Jan 2019

Fingerprint

Edge-colored Graph
Directed graphs
Complete Graph
Graph in graph theory
Multipartite Tournaments
Directed Graph
Cycle
Sufficient Conditions

Keywords

  • UT-Hybrid-D

Cite this

Li, Ruonan ; Broersma, Hajo ; Zhang, Shenggui. / Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs. In: Graphs and combinatorics. 2019 ; Vol. 35, No. 1. pp. 261-286.
@article{b94e3ec63f42428ca3bfe5d1320fc95c,
title = "Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs",
abstract = "With respect to specific cycle-related problems, edge-colored graphs can be considered as a generalization of directed graphs. We show that properly edge-colored theta graphs play a key role in characterizing the difference between edge-colored complete graphs and multipartite tournaments. We also establish sufficient conditions for an edge-colored complete graph to contain a small and a large properly edge-colored theta graph, respectively.",
keywords = "UT-Hybrid-D",
author = "Ruonan Li and Hajo Broersma and Shenggui Zhang",
note = "Springer deal",
year = "2019",
month = "1",
day = "2",
doi = "10.1007/s00373-018-1989-2",
language = "English",
volume = "35",
pages = "261--286",
journal = "Graphs and combinatorics",
issn = "0911-0119",
publisher = "Springer",
number = "1",

}

Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs. / Li, Ruonan; Broersma, Hajo (Corresponding Author); Zhang, Shenggui.

In: Graphs and combinatorics, Vol. 35, No. 1, 02.01.2019, p. 261-286.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs

AU - Li, Ruonan

AU - Broersma, Hajo

AU - Zhang, Shenggui

N1 - Springer deal

PY - 2019/1/2

Y1 - 2019/1/2

N2 - With respect to specific cycle-related problems, edge-colored graphs can be considered as a generalization of directed graphs. We show that properly edge-colored theta graphs play a key role in characterizing the difference between edge-colored complete graphs and multipartite tournaments. We also establish sufficient conditions for an edge-colored complete graph to contain a small and a large properly edge-colored theta graph, respectively.

AB - With respect to specific cycle-related problems, edge-colored graphs can be considered as a generalization of directed graphs. We show that properly edge-colored theta graphs play a key role in characterizing the difference between edge-colored complete graphs and multipartite tournaments. We also establish sufficient conditions for an edge-colored complete graph to contain a small and a large properly edge-colored theta graph, respectively.

KW - UT-Hybrid-D

U2 - 10.1007/s00373-018-1989-2

DO - 10.1007/s00373-018-1989-2

M3 - Article

VL - 35

SP - 261

EP - 286

JO - Graphs and combinatorics

JF - Graphs and combinatorics

SN - 0911-0119

IS - 1

ER -