Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result
type: Item
instance of: scholarly article
title: Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result
zbMATH Open document ID: 1472.05055
author: Ruonan Li
published in: Discrete Mathematics
publication date: 2021-09-06T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 7391501
zbMATH Keywords: edge-colored graph
zbMATH Keywords: properly edge-colored cycle
zbMATH Keywords: vertex pancyclicity
zbMATH Keywords: Hamilton cycle
zbMATH Keywords: monochromatic triangle
zbMATH Keywords: polynomial algorithm
MaRDI profile type: Publication
full work available at URL: j.disc.2021.112573
OpenAlex ID: W3187380656
cites work: Digraphs
cites work: A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
cites work: Q5545296
cites work: Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles
cites work: Alternating Hamiltonian cycles
cites work: Q5422499
cites work: Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
cites work: Properly colored paths and cycles
cites work: Transitiv orientierbare Graphen
cites work: Pancyclic and Bipancyclic Graphs
cites work: On cycles in multipartite tournaments
cites work: Properly Coloured Cycles and Paths: Results and Open Problems
cites work: Edge colorings of complete graphs without tricolored triangles
cites work: Cycle extension in edge-colored complete graphs
cites work: A classification of edge-colored graphs based on properly colored walks
cites work: An Edge-Colored Version of Dirac's Theorem
cites work: Properly coloured Hamiltonian cycles in edge-coloured complete graphs
cites work: Long properly coloured cycles in edge‐coloured graphs
cites work: On Subtournaments of a Tournament
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Multipartite tournaments: a survey
DOI: 10.1016/J.DISC.2021.112573
description: scientific article; zbMATH DE number 7391501