Alternating-Pancyclism in 2-Edge-Colored Graphs
An alternating cycle in a 2-edge-colored graph is a cycle such that any two consecutive edges have different colors. Let G1, . . ., Gkbe a collection of pairwise vertex disjoint 2-edge-colored graphs. The colored generalized sum of G1, . . ., Gk, denoted by ⊕i=1kGi \oplus _{i = 1}^k{G_i}, is the set...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2021-08-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2350 |